On the degree of complexity of sentential logics. III. An example of Johansson's minimal logic

DOI10.1007/BF00370640zbMath0636.03018MaRDI QIDQ1097873

Jacek Hawranek

Publication date: 1987

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

matrix semanticsJohansson's minimal logiclattice-theoretical language

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Cites Work

• Unnamed Item
• On the degree of complexity of sentential logics. II: An example of the logic with semi-negation
• On the degree of complexity of sentential logics. A couple of examples
• An algebraic approach to non-classical logics
• Some remarks on the consequence operation in sentential logics

This page was built for publication: On the degree of complexity of sentential logics. III. An example of Johansson's minimal logic