Institute of Information Theory and Automation

General theories of logical systems

Lecturer: Carles Noguera, Ph.D.
Faculty: Filozofická fakulta UK
Type of course: bakalářský, magisterský
Department: MTR
Semester: letní
Active: yes


Algebraic logic is the branch of mathematical logic that studies logical systems by giving them algebraic semantics. It mainly capitalizes on the standard Linbenbaum–Tarski proof of completeness of classical logic w.r.t. the two-element Boolean algebra, which can be analogously repeated in other logical systems yielding completeness w.r.t. other kinds of algebras. Abstract algebraic logic (AAL) determines what are the essential elements in these proofs and develops an abstract theory of the possible ways in which logical systems can be related to an algebraic counterpart. The usefulness of these methods is witnessed by the fact that the study of many logics, relevant for mathematics, computer science, linguistics or philosophical purposes, has greatly benefited from the algebraic approach, that allows to understand their properties in terms of equivalent algebraic properties of their semantics. This course is a self-contained introduction to AAL. We start from the very basics of AAL, develop its general and systematical theory and illustrate the results with applications to particular examples of propositional logics. 1. Basic notions of algebraic logic: formulae, proofs, logical matrices, filters, closure operators, closure systems, Schmidt Theorem, abstract Lindenbaum Lemma. Completeness theorem w.r.t. the class of all models. (Weakly) implicative logics. Examples on substructural and fuzzy logics. 2. Lindenbaum–Tarski method for weakly implicative logics: Leibniz congruence, reduced matrices, and completeness theorem w.r.t. the class of reduced models. Operators on classes of matrices. Relatively (finitely) subdirectly irreducible matrices (RFSI). Completeness theorem w.r.t. RFSI reduced models. Algebraizability and order algebraizability. Examples on substructural and fuzzy logics. 3. Leibniz operator on arbitrary logics. Leibniz hierarchy: protoalgebraic, equivalential and (weakly) algebraizable logics. Regularity and finiteness conditions. Alternative characterizations of the classes in the hierarchy. 4. Bridge theorems (deduction theorems, Craig interpolation, Beth definability). Generalized disjunctions and proof by cases properties and their role in AAL.
Responsible for information: MTR
Last modification: 16.05.2017
Institute of Information Theory and Automation