Finite Kripke models and predicate logics of provability

DOI10.2307/2274475zbMATH Open0723.03006OpenAlexW2079626851MaRDI QIDQ3211282FDOQ3211282

Authors: Giorgie Dzhaparidze, Sergei 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

Recommendations

• scientific article; zbMATH DE number 4079379
• Arithmetical interpretations and Kripke frames of predicate modal logic of provability
• scientific article; zbMATH DE number 1215499
• scientific article; zbMATH DE number 4087630
• Decidable and enumerable predicate logics of provability

zbMATH Keywords

provability logicKripke modelmodal predicate logicprovability interpretationimbedding of modal logic into Peano arithmetic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90)

Cites Work

• Provability interpretations of modal logic
• The degree of the set of sentences of predicate provability logic that are true under every interpretation
• The predicate modal logic of provability
• Title not available (Why is that?)
• Ein erweiterter Klassenkalkül

Cited In (17)

• An Arithmetically Complete Predicate Modal Logic
• AN ESCAPE FROM VARDANYAN’S THEOREM
• Title not available (Why is that?)
• Decidable Kripke models of intuitionistic theories
• Criterion for propositional calculi to be finitely generated
• Nonstandard models and Kripke's proof of the Gödel theorem
• Proof-irrelevant model of CC with predicative induction and judgmental equality
• The finite model property for knotted extensions of propositional linear logic
• Title not available (Why is that?)
• Liar-type paradoxes and the incompleteness phenomena
• Notes on models of (partial) Kripke-Feferman truth
• Title not available (Why is that?)
• A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
• ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY
• Some results on Kripke models over an arbitrary fixed frame
• Nishimura formulas as one-place logical connectives in the elementary theory of Kripke models
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter

This page was built for publication: Finite Kripke models and predicate logics of provability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211282)