Definitional equivalence and algebraizability of generalized logical systems
The author introduces and studies a concept of algebraizable sequential logic, a generalized notion of a logical system that covers, on a uniform basis, sequential systems and the quasi-equational theories of quasivarieties in Mal'tsev's sense. The author defines a concept of equivalence between generalized logics so that a logic is considered to be algebraizable whenever it is equivalent to the quasi-equational theory of a quasivariety. The author presents also a general algebraic approach to a rather wide class of sentential logics containing all intermediate logics and many interesting non-algebraizable logics.
- A propositional calculus with denumerable matrix
- Algebraic study of Sette's maximal paraconsistent logic
- Algebraizable logics
- Characterizing Belnap's Logic via De Morgan's Laws
- Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions
- scientific article; zbMATH DE number 3150809 (Why is no real title available?)
- scientific article; zbMATH DE number 3857062 (Why is no real title available?)
- scientific article; zbMATH DE number 3659568 (Why is no real title available?)
- scientific article; zbMATH DE number 67021 (Why is no real title available?)
- scientific article; zbMATH DE number 67022 (Why is no real title available?)
- scientific article; zbMATH DE number 3501559 (Why is no real title available?)
- scientific article; zbMATH DE number 3557754 (Why is no real title available?)
- scientific article; zbMATH DE number 3453564 (Why is no real title available?)
- scientific article; zbMATH DE number 3339356 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Lattices With Involution
- On Priest's logic of paradox
- The logic of paradox
- Constructive logic with strong negation is a substructural logic. II
- Implicational classes of De Morgan lattices
- Characterizing equivalential and algebraizable logics by the Leibniz operator
- Algebraic semantics for deductive systems
- On definability of the equality in classes of algebras with an equivalence relation
- Many-place sequent calculi for finitely-valued logics
- Order algebraizable logics
- Algebraizable logics with a strong conjunction and their semi-lattice based companions
- The original sin of proof-theoretic semantics
- Definability issues in universal logic
- On the deductive system of the order of an equationally orderable quasivariety
- Subquasivarieties of implicative locally-finite quasivarieties
- Equivalence of consequence relations: an order-theoretic and categorical perspective
- Correspondences between gentzen and hilbert systems
- scientific article; zbMATH DE number 5307783 (Why is no real title available?)
- A non-finitary sentential logic that is elementarily algebraizable
- Subprevarieties versus extensions. Application to the logic of paradox
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
- An abstract approach to consequence relations
- Applications of Kolmogorov complexity to computable model theory
- Fuzzy semantics for multiple-conclusion sequential calculi with structural rules
- Abstract algebraic logic. An introductory chapter
- Intuitionistic logic is a connexive logic
- Nelson algebras, residuated lattices and rough sets: A survey
- A gentle introduction to the Leibniz hierarchy
- Not necessarily distributive fuzzy semantics for multiple-conclusion sequent calculi with weak structural rules
- A relative interpolation theorem for infinitary universal Horn logic and its applications
- Selfextensional logics with a conjunction
This page was built for publication: Definitional equivalence and algebraizability of generalized logical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302288)
