On the degree of complexity of sentential logics. A couple of examples
From MaRDI portal
Publication:1163542
DOI10.1007/BF01874705zbMath0484.03011MaRDI QIDQ1163542
Publication date: 1981
Published in: Studia Logica (Search for Journal in Brave)
Related Items (3)
A Gentzen system for conditional logic ⋮ On the degree of complexity of sentential logics. III. An example of Johansson's minimal logic ⋮ On the degree of complexity of sentential logics. II: An example of the logic with semi-negation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing denumerable matrices strongly adequate for pre-finite logics
- Proof of a conjecture of Roman Suszko
- The existence of matrices strongly adequate for E, R and their fragments
- Some remarks on the consequence operation in sentential logics
- Deducibility and many-valuedness
This page was built for publication: On the degree of complexity of sentential logics. A couple of examples