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)
03B60: Other nonclassical logic
Related Items
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. III. An example of Johansson's minimal logic, A Gentzen system for conditional logic
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item