جست‌وجوی استاد و پژوهشگر

• Multialgebra Theory
• Universal Algebra
• Hyperstructure Theory
• +۳ مورد دیگر

Cosmin Pelea is a Lecturer at Babeş-Bolyai University's Faculty of Mathematics and Computer Science, Department of Mathematics. His research focuses on multialgebra theory, hyperstructures, universal algebra, and applications in category theory and fuzzy sets. He has published extensively on topics such as fundamental relations in multialgebras, hyperrings, and hypergroupoids associated with binary relations. His work includes contributions to algebraic hyperstructure theory, including studies on direct systems, direct products, and direct limits of multialgebras. Pelea has participated in numerous international conferences, such as the 6th Congress of Romanian Mathematicians (2007) and the AHA 2014 conference in Greece. His research has been supported by grants from the CNCS-UEFISCDI, including PN-II-RU-TE-2011-3-0065 and PN-II-ID-PCE-2012-4-0100. Pelea has co-authored books such as *Probleme de Algebra* (2005) and *Exercises in Abelian Group Theory* (2003), and contributed to educational materials like *Topics for Teacher Training* (2017). His academic activities span didactic responsibilities, research collaborations, and international conference presentations.

Michal Walickiمشاهده پروفایل

دانشیار

• Mathematical Logic
• Philosophical Logic
• Graph Theory
• +۱۳ مورد دیگر

Michal Walicki is an Associate Professor in the Department of Informatics at the University of Bergen, Norway. His research lies at the intersection of mathematical logic, theoretical computer science, and philosophy of logic. He specializes in graph-theoretic methods for analyzing logical paradoxes, paraconsistency, and the algebraic semantics of nondeterminism. His primary research interests include self-reference, semantic paradoxes, digraph kernels, paraconsistent logic, multialgebras, and bounded reasoning in epistemic logic. He has developed graph-based semantics for logical theories, where paradoxes correspond to graph cycles and consistent theories relate to digraph kernels. His recent work focuses on the Poison Game for infinite digraphs and a Logic of Sentential Operators (LSO) that handles unrestricted sentential quantification without explosion. His publications span journals such as the Journal of Philosophical Logic, Journal of Symbolic Logic, Synthese, and Discrete Mathematics. He has authored the textbook Introduction to Mathematical Logic and maintains comprehensive lecture notes for courses like INF-227. His work shows a strong trend in using combinatorial and algebraic structures to model logical and computational phenomena, especially in handling inconsistency and self-reference. Strongly complete axiomatizations of finite syntactic epistemic states Complete calculus for multialgebraic semantics of nondeterminism Graph Normal Form for first-order logic Paraconsistent resolution with local kernels Applications of digraph kernels to SAT solving Michal Walicki has supervised several PhD students, including Sjur Dyrkolbotn, Thomas Ågotnes, and Yngve Lamo. He has also received research funding for projects in logic and algebra, though specific grants are not detailed. He leads a research group focused on logical foundations of computation and collaborates with colleagues in logic, computer science, and philosophy. His work continues to explore the deep connections between logic, graphs, and algebraic structures.