A new proof of the fixed-point theorem of provability logic
From MaRDI portal
Publication:923072
DOI10.1305/NDJFL/1093635331zbMATH Open0712.03011OpenAlexW1972110795MaRDI QIDQ923072FDOQ923072
Authors: Lisa Reidhaar-Olson
Publication date: 1990
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093635331
Recommendations
- Note on some fixed point constructions in provability logic
- A logical analysis of fixpoint theorems
- Provability logics relative to a fixed extension of Peano arithmetic
- A proof theory for the logic of provability in true arithmetic
- New proofs in default logic theory
- Explicit Proofs in Formal Provability Logic
- The proof-theoretic analysis of transfinitely iterated fixed point theories
- Provability logics with quantifiers on proofs
- scientific article; zbMATH DE number 4072966
- scientific article; zbMATH DE number 2219536
Modal logic (including the logic of norms) (03B45) Gödel numberings and issues of incompleteness (03F40)
Cited In (12)
- Characters and fixed points in provability logic
- Title not available (Why is that?)
- An abstract look at the fixed-point theorem for provability logic
- The scope of Gödel's first incompleteness theorem
- Modal frame correspondences and fixed-points
- String indexes and the proofs of the KRT
- Solovay's completeness without fixed points
- A proof-theoretic investigation of a logic of positions
- A note on some extension results
- The Henkin sentence
- Note on some fixed point constructions in provability logic
- Effectively constructible fixed points in Sacchetti's modal logics of provability
This page was built for publication: A new proof of the fixed-point theorem of provability logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923072)