Solovay's theorem cannot be simplified

Abstract In this paper we consider three potential simplifications to a result of Solovay’s concerning the Turing degrees of nonstandard models of arbitrary completions of first-order Peano Arithmetic (PA). Solovay characterized the degrees of nonstandard models of completions T of PA, showing that they are the degrees of sets X such that there is an enumeration R ≤T X of an “appropriate” Scott set and there is a family of functions (tn)n∈ω, ∆0 n(X) uniformly in n, such that lim tn(s) s→∞.
Keywords No keywords specified (fix it)
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,679
External links This entry has no external links. Add one.
Through your library Configure

Similar books and articles

Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

5 ( #160,368 of 549,078 )

Recent downloads (6 months)

1 ( #63,317 of 549,078 )

How can I increase my downloads?


My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums