Predicate provability logic with non-modalized quantifiers
From MaRDI portal
Publication:1176101
DOI10.1007/BF00370393zbMath0736.03004MaRDI QIDQ1176101
Publication date: 25 June 1992
Published in: Studia Logica (Search for Journal in Brave)
Kripke models; Peano arithmetic; provability logic; predicate modal logic; recursive enumerability; Gödel numbers; Gödel-Löb's logic GL; provably binumerable; Solovay's logic S
03B45: Modal logic (including the logic of norms)
03F30: First-order arithmetic and fragments
03F40: Gödel numberings and issues of incompleteness
Cites Work
- Unnamed Item
- Decidable and enumerable predicate logics of provability
- The predicate modal logic of provability
- Omega-consistency and the diamond
- Provability interpretations of modal logic
- Arithmetization of metamathematics in a general setting
- The degree of the set of sentences of predicate provability logic that are true under every interpretation