Some structure results for propositional calculi
From MaRDI portal
Publication:5582301
DOI10.2307/2269618zbMath0188.31401OpenAlexW2046780264MaRDI QIDQ5582301
Publication date: 1965
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2269618
Related Items
Varieties of algebraic systems and propositional calculi ⋮ For Want of an ‘And’: A Puzzle about Non-Conservative Extension ⋮ Semantic analysis of tense logics ⋮ Algorithms for finding matrix models of propositional calculi ⋮ Some remarks on the concept of completeness of the propositional calculus. I ⋮ Matrix approach in methodology of sentential calculi ⋮ Equational axioms for classes of Heyting algebras ⋮ Some results concerning finite model separability of propositional calculi ⋮ A consistent prepositional logic without any finite models ⋮ The finite model property and recursive bounds on the size of countermodels
Cites Work
- On a fragment of the implicative propositional calculus
- On disjunctions and existential statements in intuitionistic systems of logic
- On intermediate many-valued logics
- An extension algebra and the modal system
- On closed elements in closure algebras
- Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
- The Finite Model Property and Subsystems of Classical Propositional Calculus
- A propositional calculus with denumerable matrix
- A complex of problems proposed by Post
- Modal Logics Between S 4 and S 5
- Partial results regarding word problems and recursively enumerable degrees of unsolvability
- A NOTE ON THE MODAL CALCULI S 4.2 AND S 4.3
- Note on a property of matrices for Lewis and Langford's calculi of propositions
- Results concerning the decision problem of Lewis's calculi S3 and S6
- Some theorems about the sentential calculi of Lewis and Heyting
This page was built for publication: Some structure results for propositional calculi
