Basic Propositional Calculus I
- 1 January 1998
- journal article
- research article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 44 (3) , 317-343
Abstract
We present an axiomatization for Basic Propositional Calculus BPC and give a completeness theorem for the class of transitive Kripke structures. We present several refinements, including a completeness theorem for irreflexive trees. The class of intermediate logics includes two maximal nodes, one being Classical Propositional Calculus CPC, the other being E1, a theory axiomatized by T → ⊥. The intersection CPC ∩ E1 is axiomatizable by the Principle of the Excluded Middle A V ∨ ⌝A. If B is a formula such that (T → B) → B is not derivable, then the lattice of formulas built from one propositional variable p using only the binary connectives, is isomorphically preserved if B is substituted for p. A formula (T → B) → B is derivable exactly when B is provably equivalent to a formula of the form ((T → A) → A) → (T → A).Keywords
This publication has 5 references indexed in Scilit:
- Self-Reference and Modal Logic1985
- A propositional logic with explicit fixed pointsStudia Logica, 1981
- Some embedding theorems for modal logic.Notre Dame Journal of Formal Logic, 1971
- Modal logics with linear alternative relationsTheoria, 1970
- A completeness theorem in modal logicThe Journal of Symbolic Logic, 1959