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 modelsPeano arithmeticprovability logicpredicate modal logicrecursive enumerabilityGödel numbersGödel-Löb's logic GLprovably binumerableSolovay's logic S
Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)
Cites Work
- 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
- Unnamed Item