Algebraizable logics with a strong conjunction and their semi-lattice based companions

DOI10.1007/s00153-012-0301-zzbMath1408.03040OpenAlexW2019555767MaRDI QIDQ1938393

Ramon Jansana

Publication date: 4 February 2013

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-012-0301-z

zbMATH Keywords

abstract algebraic logicalgebraizable logicslogics based on semilatticesstrongly algebraizable logics

Mathematics Subject Classification ID

Semilattices (06A12) Abstract deductive systems (03B22) Abstract algebraic logic (03G27)

Related Items (6)

The strong version of a sentential logic ⋮ Consequence and Degrees of Truth in Many-Valued Logic ⋮ Selfextensional logics with a distributive nearlattice term ⋮ Leibniz-linked pairs of deductive systems ⋮ Monotonic modal logics with a conjunction ⋮ Countably many weakenings of Belnap-Dunn logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selfextensional logics with a conjunction
• Implicational (semilinear) logics. I: A new hierarchy
• Definitional equivalence and algebraizability of generalized logical systems
• Leibniz filters revisited
• A survey of abstract algebraic logic
• The Suszko operator. I
• Algebraic study of two deductive systems of relevance logic
• Correspondences between gentzen and hilbert systems
• Logics Preserving Degrees of Truth from Varieties of Residuated Lattices
• Algebraizable logics
• Protoalgebraic logics
• Leibniz filters and the strong version of a protoalgebraic logic

This page was built for publication: Algebraizable logics with a strong conjunction and their semi-lattice based companions