Switch to: References

Add citations

You must login to add citations.
  1. Variations on the Kripke Trick.Mikhail Rybakov & Dmitry Shkatov - forthcoming - Studia Logica:1-48.
    In the early 1960s, to prove undecidability of monadic fragments of sublogics of the predicate modal logic $$\textbf{QS5}$$ QS 5 that include the classical predicate logic $$\textbf{QCl}$$ QCl, Saul Kripke showed how a classical atomic formula with a binary predicate letter can be simulated by a monadic modal formula. We consider adaptations of Kripke’s simulation, which we call the Kripke trick, to various modal and superintuitionistic predicate logics not considered by Kripke. We also discuss settings where the Kripke trick does (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness.Mikhail Rybakov - forthcoming - Logic Journal of the IGPL.
    In this paper, the predicate counterparts, defined both axiomatically and semantically by means of Kripke frames, of the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ and their extensions are considered. It is proved that the set of semantical consequences on Kripke frames of every logic between $\textbf {QwGrz}$ and $\textbf {QGL.3}$ or between $\textbf {QwGrz}$ and $\textbf {QGrz.3}$ is $\Pi ^1_1$-hard even in languages with three (sometimes, two) individual variables, two (sometimes, one) unary predicate letters, and a single (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations