The simplest protoalgebraic logic

DOI10.1002/malq.201200052zbMath1320.03091OpenAlexW1927491598MaRDI QIDQ5396225

Josep Maria Font

Publication date: 5 February 2014

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

Full work available at URL: https://doi.org/10.1002/malq.201200052

zbMATH Keywords

abstract algebraic logicLeibniz operatorimplicationparameterized deduction theorem

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Abstract deductive systems (03B22) Abstract algebraic logic (03G27)

Related Items

ON EQUATIONAL COMPLETENESS THEOREMS, AN ABSTRACT ALGEBRAIC LOGIC STUDY OF DA COSTA’S LOGIC AND SOME OF ITS PARACONSISTENT EXTENSIONS, Erratum to J. M. Font, The simplest protoalgebraic logic, Characterizing finite-valuedness, THE POSET OF ALL LOGICS II: LEIBNIZ CLASSES AND HIERARCHY

Cites Work

• Unnamed Item
• Unnamed Item
• Leibniz interpolation properties
• Contextual deduction theorems
• \(C_ 1\) is not algebraizable
• Theory of logical calculi. Basic theory of consequence operations
• An algebraic approach to non-classical logics
• Admissibility of logical inference rules
• A survey of abstract algebraic logic
• Algebraic semantics for deductive systems
• On the closure properties of the class of full G-models of a deductive system
• Beyond Rasiowa's algebraic approach to non-classical logics
• Algebraizable logics
• On weakening the Deduction Theorem and strengthening Modus Ponens
• Inconsistency lemmas in algebraic logic
• Some theorems about the sentential calculi of Lewis and Heyting