Effective versions of Ramsey's Theorem: Avoiding the cone above 0′

DOI10.2307/2275707zbMath0815.03028OpenAlexW2016227329MaRDI QIDQ4323045

Tamara Lakins Hummel

Publication date: 16 March 1995

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

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

zbMATH Keywords

reverse mathematicsRamsey's theoremhomogeneous setTuring degreesrecursive colorings

Mathematics Subject Classification ID

Other constructive mathematics (03F65) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Generalized cohesiveness, On the strength of Ramsey's theorem for pairs, Reverse mathematics, computability, and partitions of trees, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, Partition Theorems and Computability Theory, Ramsey's theorem and cone avoidance, Stability and posets

Cites Work

• Unnamed Item
• A cohesive set which is not high
• Class groups of integral group rings