Solovay's completeness without fixed points
From MaRDI portal
Abstract: In this paper we present a new proof of Solovay's theorem on arithmetical completeness of G"odel-L"ob provability logic GL. Originally, completeness of GL with respect to interpretation of as provability in PA was proved by R. Solovay in 1976. The key part of Solovay's proof was his construction of an arithmetical evaluation for a given modal formula that made the formula unprovable PA if it were unprovable in GL. The arithmetical sentences for the evaluations were constructed using certain arithmetical fixed points. The method developed by Solovay have been used for establishing similar semantics for many other logics. In our proof we develop new more explicit construction of required evaluations that doesn't use any fixed points in their definitions. To our knowledge, it is the first alternative proof of the theorem that is essentially different from Solovay's proof in this key part.
Recommendations
Cited in
(8)- On the proof of Solovay's theorem
- Solovay's relative consistency proof for FIM and BI
- Absoluteness of the Solovay set \(\Sigma \)
- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
- Solovay-type theorems for circular definitions
- scientific article; zbMATH DE number 1303440 (Why is no real title available?)
- THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH
- Paradoxes behind the Solovay sentences
This page was built for publication: Solovay's completeness without fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685933)