A survey of propositional modal logic in an intuitionistic setting, including a new logic $\textbf{KI}$ for which it is proved completeness, and a deeper look at the logics lying between the CML and IML traditions.
Abstract
This paper gives a survey of propositional modal logic in an intuitionistic setting. Mainly intended for readers already familiar with classical modal logic, we discuss why there are two prominent families of such logics, intuitionistic modal logics (IMLs) and constructive modal logics (CMLs), what motivates their study, and how they compare with each other. Moreover, we take a deeper look at the logics lying between the CML and IML traditions, including a new logic $\textbf{KI}$ for which we prove completeness, and survey various extensions and $\Diamond$/$\Box$-free fragments. We further record several observations which seem to be implicit or absent in the literature; we point out a small defect in the original semantics for $\textbf{CK}$ and prove Lyndon interpolation theorems for $\textbf{CK}$ and $\textbf{WK}$.
G\"odel-L\"ob provability logic $\GL$ is a propositional modal system that on one hand enjoys completeness with respect to conversely well-founded Kripke frames and on the other hand captures all modal principles about $\PA$-provability that are provable in $\PA$ itself. In the present paper we carry out an initial inv...
Mojtaba Mojtahedi, F. Pakhomov, G. Soldà· 0 citations
New proofs of weak normalization for intuitionistic and classical propositional logics (with the full set of operators -- falsum, implication, conjunction and disjunction) are presented and a deterministic algorithm for weak normalization is presented.
Carnap [5] in 1943 noticed that there exist some non-normal valuations that do not respect the usual truth conditions of classical connectives, yet are sound. This finding reveals an asymmetry between the syntax and semantics of classical logic and might be counted as a challenge to the inferentialist program. While se...
J. Jafari, Davood Hosseini· Australasian Journal of Logi...· 0 citations
{Non-contingency logic $(\KWL)$ replaces the usual necessity operator of modal logic with an operator expressing that a proposition is necessarily true or necessarily false. Besides its intrinsic logical interest, it admits natural interpretations as knowing whether in epistemic logic and as decidability under the arit...
It is proved that $\mathbf{B}_{ti}$ is the multiple-succedent sequent calculus read upside down, that $\mathbf{G}_{ti}$ admits the structural rules, and that $\mathbf{B}_{ti}$ is sound and complete for Kripke semantics, with the finite model property and a block-theoretic proof of the disjunction property.
A modal logic is elementary if it is sound and complete with respect to an elementary class of Kripke frames. We prove that if a finitely axiomatizable modal logic L is elementary, then the validity problem for L, which asks whether a given finite Kripke frame validates L, is in P. This allows us to transfer complexity...
Tenyo Takahashi· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
