On the proof of Solovay's theorem

Studia Logica 50 (1):51 - 69 (1991)
  Copy   BIBTEX

Abstract

Solovay's 1976 completeness result for modal provability logic employs the recursion theorem in its proof. It is shown that the uses of the recursion theorem can in this proof be replaced by the diagonalization lemma for arithmetic and that, in effect, the proof neatly fits the framework of another, enriched, system of modal logic (the so-called Rosser logic of Gauspari-Solovay, 1979) so that any arithmetical system for which this logic is sound is strong enough to carry out the proof, in particular I0+EXP. The method is adapted to obtain a similar completeness result for the Rosser logic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
53 (#268,373)

6 months
3 (#445,838)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dick De De Jongh
University of Amsterdam

Citations of this work

On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
Friedman-reflexivity.Albert Visser - 2022 - Annals of Pure and Applied Logic 173 (9):103160.
The Arithmetics of a Theory.Albert Visser - 2015 - Notre Dame Journal of Formal Logic 56 (1):81-119.

View all 11 citations / Add more citations

References found in this work

Self-Reference and Modal Logic.George Boolos & C. Smorynski - 1988 - Journal of Symbolic Logic 53 (1):306.
Rosser sentences.D. Guaspari - 1979 - Annals of Mathematical Logic 16 (1):81.

Add more references