A recursion theoretic analysis of the clopen Ramsey theorem

Journal of Symbolic Logic 49 (2):376-400 (1984)
Abstract
Solovay has shown that if F: [ω] ω → 2 is a clopen partition with recursive code, then there is an infinite homogeneous hyperarithmetic set for the partition (a basis result). Simpson has shown that for every 0 α , where α is a recursive ordinal, there is a clopen partition F: [ω] ω → 2 such that every infinite homogeneous set is Turing above 0 α (an anti-basis result). Here we refine these results, by associating the "order type" of a clopen set with the Turing complexity of the infinite homogeneous sets. We also consider the Nash-Williams barrier theorem and its relation to the clopen Ramsey theorem
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274171
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: 23,316
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Keh-Hsun Chen (1978). Recursive Well-Founded Orderings. Annals of Mathematical Logic 13 (2):117-147.
D. -H. Chen (1978). Recursice Well-Founded Orderings. Annals of Pure and Applied Logic 13 (2):117.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

5 ( #578,629 of 1,926,202 )

Recent downloads (6 months)

1 ( #453,420 of 1,926,202 )

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.