A new proof of the fixed-point theorem of provability logic

DOI10.1305/NDJFL/1093635331MaRDI QIDQ923072zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fixed-point theoremKripke modelsmodal logic G of provability

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Gödel numberings and issues of incompleteness (03F40)

Review text

A semantic proof of the fixed-point theorem for the modal logic G of provability is given, modeled after Sambin's syntactic proof, which is rather complicated but provides algorithms for the explicit calculation of fixed-points. The new proof featuring Kripke models is simple and shows an algorithm for fixed-point calculation as well, with which the fixed-point is obtained in the same general appearance as the original formula. Some examples of fixed-point calculations are also given.

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

Cited in

(14)

• A proof-theoretic investigation of a logic of positions
• Solovay's completeness without fixed points
• A note on some extension results
• Syntactical models and fixed points for the basic logic of proofs
• Effectively constructible fixed points in Sacchetti's modal logics of provability
• The scope of Gödel's first incompleteness theorem
• Modal frame correspondences and fixed-points
• Note on some fixed point constructions in provability logic
• The Henkin sentence
• scientific article; zbMATH DE number 4029553 (Why is no real title available?)
• String indexes and the proofs of the KRT
• An abstract look at the fixed-point theorem for provability logic
• Exponential lower bounds on definable fixed points
• Characters and fixed points in provability logic

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)