655 research outputs found
Grafting Hypersequents onto Nested Sequents
We introduce a new Gentzen-style framework of grafted hypersequents that
combines the formalism of nested sequents with that of hypersequents. To
illustrate the potential of the framework, we present novel calculi for the
modal logics and , as well as for extensions of the
modal logics and with the axiom for shift
reflexivity. The latter of these extensions is also known as
in the context of deontic logic. All our calculi enjoy syntactic cut
elimination and can be used in backwards proof search procedures of optimal
complexity. The tableaufication of the calculi for and
yields simplified prefixed tableau calculi for these logic
reminiscent of the simplified tableau system for , which might be
of independent interest
Extensions of K5: Proof Theory and Uniform Lyndon Interpolation
We introduce a Gentzen-style framework, called layered sequent calculi, for
modal logic K5 and its extensions KD5, K45, KD45, KB5, and S5 with the goal to
investigate the uniform Lyndon interpolation property (ULIP), which implies
both the uniform interpolation property and the Lyndon interpolation property.
We obtain complexity-optimal decision procedures for all logics and present a
constructive proof of the ULIP for K5, which to the best of our knowledge, is
the first such syntactic proof. To prove that the interpolant is correct, we
use model-theoretic methods, especially bisimulation modulo literals.Comment: 20-page conference paper + 5-page appendix with examples and proof
Deciding regular grammar logics with converse through first-order logic
We provide a simple translation of the satisfiability problem for regular
grammar logics with converse into GF2, which is the intersection of the guarded
fragment and the 2-variable fragment of first-order logic. This translation is
theoretically interesting because it translates modal logics with certain frame
conditions into first-order logic, without explicitly expressing the frame
conditions.
A consequence of the translation is that the general satisfiability problem
for regular grammar logics with converse is in EXPTIME. This extends a previous
result of the first author for grammar logics without converse. Using the same
method, we show how some other modal logics can be naturally translated into
GF2, including nominal tense logics and intuitionistic logic.
In our view, the results in this paper show that the natural first-order
fragment corresponding to regular grammar logics is simply GF2 without extra
machinery such as fixed point-operators.Comment: 34 page
On Nested Sequents for Constructive Modal Logics
We present deductive systems for various modal logics that can be obtained
from the constructive variant of the normal modal logic CK by adding
combinations of the axioms d, t, b, 4, and 5. This includes the constructive
variants of the standard modal logics K4, S4, and S5. We use for our
presentation the formalism of nested sequents and give a syntactic proof of cut
elimination.Comment: 33 page
Disappearing Diamonds: Fitch-Like Results in Bimodal Logic
Augment the propositional language with two modal operators: □ and ■. Define ⧫ to be the dual of ■, i.e. ⧫=¬■¬. Whenever (X) is of the form φ → ψ, let (X⧫) be φ→⧫ψ . (X⧫) can be thought of as the modally qualified counterpart of (X)—for instance, under the metaphysical interpretation of ⧫, where (X) says φ implies ψ, (X⧫) says φ implies possibly ψ. This paper shows that for various interesting instances of (X), fairly weak assumptions suffice for (X⧫) to imply (X)—so, the modally qualified principle is as strong as its unqualified counterpart. These results have surprising and interesting implications for issues spanning many areas of philosophy
- …