A recursion theoretic analysis of the clopen Ramsey theorem

Journal of Symbolic Logic 49 (2):376-400 (1984)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

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

Through your library

Similar books and articles

On the Ramsey property for sets of reals.Ilias G. Kastanas - 1983 - Journal of Symbolic Logic 48 (4):1035-1045.
Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.
An effective proof that open sets are Ramsey.Jeremy Avigad - 1998 - Archive for Mathematical Logic 37 (4):235-240.
A baire-type theorem for cardinals.Kurt Wolfsdorf - 1983 - Journal of Symbolic Logic 48 (4):1082-1089.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.
Nonstandard combinatorics.Joram Hirshfeld - 1988 - Studia Logica 47 (3):221 - 232.
A generalization of the limit lemma and clopen games.Peter Clote - 1986 - Journal of Symbolic Logic 51 (2):273-291.

Analytics

Added to PP
2009-01-28

Downloads
21 (#740,927)

6 months
6 (#529,161)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Partial impredicativity in reverse mathematics.Henry Towsner - 2013 - Journal of Symbolic Logic 78 (2):459-488.

Add more citations

References found in this work

Recursive well-founded orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.
Recursice well-founded orderings.D. -H. Chen - 1978 - Annals of Mathematical Logic 13 (2):117.

Add more references