A conservative extension of relational cover semantics is presented that alleviates a restriction that restricts the class of models and complicates model construction and is amenable to simpler and standard model construction techniques.
Abstract
Intuitionistic modal logic (IML) has inspired several developments in programming languages including modal type systems for staging, computational effects and language-based security. IMLs are typically studied using Kripke-style relational semantics, which simplifies proofs of meta-theoretic properties, such as completeness and consistency, by making it easy to construct models. Kripke-style relational semantics, however, relies upon classical reasoning principles, which makes it unappealing from a computational perspective and unsuitable for formalization in a constructive type theory. Goldblatt provides an alternative semantics for IMLs by extending Beth-Kripke-Joyal-style"cover"semantics for intuitionistic propositional logic with relations to support modalities. Goldblatt's"relational cover"semantics overcomes classical reasoning but introduces a new limitation: it relies upon a"modal localization"condition that restricts the class of models and complicates model construction. Goldblatt bypasses this restriction by using intricate order-theoretic completion arguments to prove completeness. In this article, we present a conservative extension of relational cover semantics that alleviates this restriction and is amenable to simpler and standard model construction techniques. We formalize our semantics in Agda and prove completeness constructively in the style of Normalization by Evaluation for a variety of IMLs featuring independent box and diamond modalities.
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.
This work constructs paired modal problems with identical premises and conjecture but different frame or domain conditions; automated reasoning verifies opposite labels and releases the formulas, oracle artifacts, countermodels, and responses.
A coNEXPTIME upper bound for the validity problem of RmbC and a coNP-hardness lower bound are established, and coNP-completeness for the principal extensions containing one of the six minimal explosive pairs are proved.
Nāgārjuna’s arguments in the Mūlamadhyamakakārikā rely extensively on modus tollens, yet this inference is invalid in the paraconsistent frameworks typically used to formalize the catuṣkoṭi. We develop a modal extension of Belnap-Dunn semantics to address this, expressed as: ¬□(v(P) = t) ∧ ¬□(v(P) = f) ∧ ¬□(v(P) = b) ∧...
This work proposes to consider the three refined GAS principles as alternative principles for answer set semantics in general and for answer set and world view construction in particular and analyzes the computational complexity of well-supportedness and the rational answer set and world view semantics.
Yi-Dong Shen, Thomas Eiter· ACM Transactions on Computat...· 0 citations
We present a new proof of the embedding of the classical modal logic S4 into the logic of Boolean Bunched Implications (BBI). While the original proof is semantical, this proof is entirely syntactical. It proceeds via Hilbert-style calculi, and is built by analogy with a recently discovered proof by Godel of the embedd...
Daniele Sansoni, Ranald Clouston· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.