Finite Kripke models and predicate logics of provability
From MaRDI portal
Publication:3211282
DOI10.2307/2274475zbMath0723.03006OpenAlexW2079626851MaRDI QIDQ3211282
Giorgie Dzhaparidze, Sergej N. Artemov
Publication date: 1990
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274475
provability logicKripke modelmodal predicate logicprovability interpretationimbedding of modal logic into Peano arithmetic
Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Gödel numberings and issues of incompleteness (03F40)
Related Items (6)
Liar-type paradoxes and the incompleteness phenomena ⋮ Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ An Arithmetically Complete Predicate Modal Logic ⋮ A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs ⋮ AN ESCAPE FROM VARDANYAN’S THEOREM ⋮ ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY
Cites Work
This page was built for publication: Finite Kripke models and predicate logics of provability