Switch to: References

Add citations

You must login to add citations.
  1. 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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Theory and application of labelling techniques for interpretability logics.Evan Goris, Marta Bílková, Joost J. Joosten & Luka Mikec - 2022 - Mathematical Logic Quarterly 68 (3):352-374.
    The notion of a critical successor [5] in relational semantics has been central to most classic modal completeness proofs in interpretability logics. In this paper we shall work with a more general notion, that of an assuring successor. This will enable more concisely formulated completeness proofs, both with respect to ordinary and generalised Veltman semantics. Due to their interesting theoretical properties, we will devote some space to the study of a particular kind of assuring labels, the so‐called full labels and (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark