Finite Kripke models and predicate logics of provability
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
- An Arithmetically Complete Predicate Modal Logic
- AN ESCAPE FROM VARDANYAN’S THEOREM
- Decidable Kripke models of intuitionistic theories
- scientific article; zbMATH DE number 125989 (Why is no real title available?)
- Arithmetical interpretations and Kripke frames of predicate modal logic of provability
- 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
- Liar-type paradoxes and the incompleteness phenomena
- scientific article; zbMATH DE number 6302903 (Why is no real title available?)
- Notes on models of (partial) Kripke-Feferman truth
- scientific article; zbMATH DE number 7297896 (Why is no real title available?)
- A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
- A modal logic of a truth definition for finite models
- Nishimura formulas as one-place logical connectives in the elementary theory of Kripke models
- Some results on Kripke models over an arbitrary fixed frame
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)