Switch to: References

Add citations

You must login to add citations.
  1. Modal Companions of $$K4^{+}$$.Mikhail Svyatlovskiy - 2022 - Studia Logica 110 (5):1327-1347.
    We study modal companions of $$K4^+$$, the strictly positive fragment of K4. We partially find the boundary between all normal extensions of K4 and modal companions of $$K4^+$$ among them. We also show that there is no greatest modal companion of $$K4^+$$.
    Download  
     
    Export citation  
     
    Bookmark  
  • Complexity of the interpretability logic IL.Luka Mikec, Fedor Pakhomov & Mladen Vuković - forthcoming - Logic Journal of the IGPL.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Complexity of the interpretability logics ILW and ILP.Luka Mikec - 2023 - Logic Journal of the IGPL 31 (1):194-213.
    The interpretability logic ILP is the interpretability logic of all sufficiently strong |$\varSigma _1$|-sound finitely axiomatised theories, such as the Gödel-Bernays set theory. The interpretability logic IL is a strict subset of the intersection of the interpretability logics of all so-called reasonable theories, IL(All). It is known that both ILP and ILW are decidable, however their complexity has not been resolved previously. In [10] it was shown that the basic interpretability logic IL is PSPACE-complete. Here we prove the same for (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Strictly Positive Fragments of the Provability Logic of Heyting Arithmetic.Ana de Almeida Borges & Joost J. Joosten - forthcoming - Studia Logica:1-33.
    We determine the strictly positive fragment \(\textsf{QPL}^+(\textsf{HA})\) of the quantified provability logic \(\textsf{QPL}(\textsf{HA})\) of Heyting Arithmetic. We show that \(\textsf{QPL}^+(\textsf{HA})\) is decidable and that it coincides with \(\textsf{QPL}^+(\textsf{PA})\), which is the strictly positive fragment of the quantified provability logic of of Peano Arithmetic. This positively resolves a previous conjecture of the authors described in [ 14 ]. On our way to proving these results, we carve out the strictly positive fragment \(\textsf{PL}^+(\textsf{HA})\) of the provability logic \(\textsf{PL}(\textsf{HA})\) of Heyting Arithmetic, provide (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On Provability Logics with Linearly Ordered Modalities.Lev D. Beklemishev, David Fernández-Duque & Joost J. Joosten - 2014 - Studia Logica 102 (3):541-566.
    We introduce the logics GLP Λ, a generalization of Japaridze’s polymodal provability logic GLP ω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLP ω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLP Λ and the decidability of GLP Λ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free fragment (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations