Solovay's completeness without fixed points

DOI10.1007/978-3-662-55386-2_20MaRDI QIDQ1685933zbMATH OpenOpenAlexFDO

Authors Fedor N. Pakhomov

Publication date 20 December 2017

Full work available at URL https://arxiv.org/abs/1703.10262

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

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 $Box$ 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

• On the proof of Solovay's theorem
• A new proof of the fixed-point theorem of provability logic
• A proof theory for the logic of provability in true arithmetic
• Provability logic—a short introduction
• scientific article; zbMATH DE number 915329

Cited in

(7)

• The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
• scientific article; zbMATH DE number 1303440 (Why is no real title available?)
• Paradoxes behind the Solovay sentences
• On the proof of Solovay's theorem
• Solovay-type theorems for circular definitions
• THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH
• Absoluteness of the Solovay set \(\Sigma \)

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)