A simplification of the completeness proofs for Guaspari and Solovay's ${\rm R}$
Notre Dame Journal of Formal Logic 31 (1):44-63 (1989)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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,679 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesDick H. J. Jongh (1987). A Simplification of a Completeness Proof of Guaspari and Solovay. Studia Logica 46 (2):187 - 192.
Vítězslav Švejdar (1983). Modal Analysis of Generalized Rosser Sentences. Journal of Symbolic Logic 48 (4):986-999.
Paolo Gentilini (1993). Syntactical Results on the Arithmetical Completeness of Modal Logic. Studia Logica 52 (4):549 - 564.
Dick Jongh, Marc Jumelet & Franco Montagna (1991). On the Proof of Solovay's Theorem. Studia Logica 50 (1):51 - 69.
Vladimir Kanovei (1997). An Ulm-Type Classification Theorem for Equivalence Relations in Solovay Model. Journal of Symbolic Logic 62 (4):1333-1351.
Branden Fitelson (2001). Comments on Some Completeness Theorems of Urquhart and Méndez & Salto. Journal of Philosophical Logic 30 (1):51 - 55.
Janusz Pawlikowski (1986). Why Solovay Real Produces Cohen Real. Journal of Symbolic Logic 51 (4):957-968.
Kenneth Harris & Branden Fitelson (2001). Comments on Some Completeness Theorems of Urquhart and Méndez & Salto. Journal of Philosophical Logic 30 (1):51-55.
C. G. Jockusch Jr, M. Lerman, R. I. Soare & R. M. Solovay (1989). Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. Journal of Symbolic Logic 54 (4):1288 - 1323.
John Corcoran (1969). Three Logical Theories. Philosophy of Science 36 (2):153-177.
C. G. Jockusch Jr, M. Lerman, R. I. Soare & R. M. Solovay (1989). Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. Journal of Symbolic Logic 54 (4):1288 - 1323.
R. F. Blute & P. J. Scott (1998). The Shuffle Hopf Algebra and Noncommutative Full Completeness. Journal of Symbolic Logic 63 (4):1413-1436.
Paweł Garbacz (2011). Prover9's Simplification Explained Away. Australasian Journal of Philosophy 90 (3):585 - 592.
Andrew Arana (2001). Solovay's Theorem Cannot Be Simplified. Annals of Pure and Applied Logic 112.
Analytics
Monthly downloads |
Added to index2010-08-24Total downloads4 ( #178,675 of 549,088 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
