A recursion theoretic analysis of the clopen Ramsey theorem

DOI10.2307/2274171zbMath0574.03030OpenAlexW2052512891MaRDI QIDQ3691655

Peter Clote

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274171

zbMATH Keywords

basisclopen setanti-basishyperarithmetic setsGalvin-Prikry theoremlimit lemmaclopen partitioninfinite homogeneous setNash Williams' barrier theorem

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Axiomatics of classical set theory and its fragments (03E30) Applications of computability and recursion theory (03D80) Hierarchies of computability and definability (03D55)

Related Items

Optimal bounds for ordinal comparison maps ⋮ Foundations of BQO Theory ⋮ Intuitionism: an inspiration?

Cites Work

• Unnamed Item
• Unnamed Item
• Countable retracing functions and \(\Pi_2^0\) predicates
• Recursive well-founded orderings
• Sets which do not have subsets of every higher degree