Basic Propositional Calculus I

From MaRDI portal





The system of modal logic \({\mathbf K}4\) can be considered as a generalization of both Lewis' \({\mathbf S}4\) and provability logic \({\mathbf G}\) [see \textit{C. Smoryński}, Self-reference and modal logic (1985; Zbl 0596.03001)]. On the other hand, the Heyting propositional calculus \({\mathbf H}\) presents a purely propositional counterpart of \({\mathbf S}4\). In this context, the propositional systems \({\mathbf B}{\mathbf P}{\mathbf C}\) (Basic Propositional Calculus) and \({\mathbf F}{\mathbf P}{\mathbf C}\) (Formal Propositional Calculus), satisfying the following informal `proportion' \({\mathbf H}:{\mathbf S}4={\mathbf F}{\mathbf P}{\mathbf C}:{\mathbf G}= {\mathbf B}{\mathbf P}{\mathbf C}:{\mathbf K}4\), occur quite naturally [see \textit{A. Visser}, ``A propositional logic with explicit fixed points, Stud. Logica 40, 155-175 (1981; Zbl 0469.03012)]. However, \({\mathbf B}{\mathbf P}{\mathbf C}\) remains an exotic system even to those concerned with nonclassical logics. This paper presents an overview of \({\mathbf B}{\mathbf P}{\mathbf C}\) including the corresponding axiomatization and a development of a Kripke-type semantics for \({\mathbf B}{\mathbf P}{\mathbf C}\). The main result is a completeness theorem for the class of transitive Kripke structures, followed by several interesting refinements. As byproducts, some results related to the systems \({\mathbf H}\), \({\mathbf F}{\mathbf P}{\mathbf C}\) and classical propositional calculus are obtained as well.




Cited in
(38)








This page was built for publication: Basic Propositional Calculus I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210835)