On the proof of Solovay's theorem
Studia Logica 50 (1):51 - 69 (1991)
| 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. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAnita Wasilewska (1984). DFC-Algorithms for Suszko Logic and One-to-One Gentzen Type Formalizations. Studia Logica 43 (4):395 - 404.
Paolo Gentilini (1999). Proof-Theoretic Modal Pa-Completeness I: A System-Sequent Metric. Studia Logica 63 (1):27-48.
Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge (2008). Strong Completeness and Limited Canonicity for PDL. Journal of Logic, Language and Information 17 (1).
Takahito Aoto (1999). Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. Journal of Logic, Language and Information 8 (2):217-242.
Dick Jongh & Franco Montagna (1991). Rosser Orderings and Free Variables. Studia Logica 50 (1):71 - 80.
Paolo Gentilini (1999). Proof-Theoretic Modal PA-Completeness III: The Syntactic Proof. Studia Logica 63 (3):301-310.
Dick H. J. Jongh (1987). A Simplification of a Completeness Proof of Guaspari and Solovay. Studia Logica 46 (2):187 - 192.
Sergei Artemov & Giorgie Dzhaparidze (1990). Finite Kripke Models and Predicate Logics of Provability. Journal of Symbolic Logic 55 (3):1090-1098.
Paolo Gentilini (1993). Syntactical Results on the Arithmetical Completeness of Modal Logic. Studia Logica 52 (4):549 - 564.
Dick H. J. Jongh & Franco Montagna (1987). Generic Generalized Rosser Fixed Points. Studia Logica 46 (2):193 - 203.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads14 ( #84,198 of 556,775 )Recent downloads (6 months)1 ( #64,847 of 556,775 )How can I increase my downloads? |
My notes
Discussion
