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

DOI10.2307/2275707MaRDI QIDQ4323045zbMATH OpenOpenAlexFDO

Authors 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

homogeneous setRamsey's theoremrecursive coloringsreverse mathematicsTuring degrees

Mathematics Subject Classification ID

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

Recommendations

• Ramsey's theorem and cone avoidance
• On the strength of Ramsey's theorem for pairs
• The strength of Ramsey's theorem for coloring relatively large sets
• Ramsey-like theorems and moduli of computation
• On the strength of Ramsey's theorem

Cites work

• A cohesive set which is not high
• Class groups of integral group rings
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)

Cited in

(28)

• The polarized Ramsey's theorem
• Two remarks on Ramsey's theorem
• An effective proof that open sets are Ramsey
• Bootstrapping the primitive recursive functions by only 27 colors
• Some Ramsey-type theorems for countably determined sets
• Effectiveness for the dual Ramsey theorem
• Some logically weak Ramseyan theorems
• On the strength of Ramsey's theorem for pairs
• Ramsey's theorem for computably enumerable colorings
• A _2⁰ set with no infinite low subset in either it or its complement
• (Un)countable and (non)effective versions of Ramsey's theorem
• scientific article; zbMATH DE number 3869323 (Why is no real title available?)
• Partition Theorems and Computability Theory
• Reverse mathematics, computability, and partitions of trees
• 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
• Ramsey's theorem and cone avoidance
• Stability and posets
• scientific article; zbMATH DE number 3916250 (Why is no real title available?)
• Generalized cohesiveness
• On the uniform computational content of Ramsey's theorem
• Coloring the rationals in reverse mathematics
• A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids
• Cappable CEA sets and Ramsey's theorem
• Ramsey-like theorems and moduli of computation
• Computable Ramsey's theorem for pairs needs infinitely many \(\Pi ^0_2\) sets
• Brown's lemma in second-order arithmetic
• scientific article; zbMATH DE number 2236628 (Why is no real title available?)
• Ramsey-type graph coloring and diagonal non-computability

This page was built for publication: Effective versions of Ramsey's Theorem: Avoiding the cone above 0′

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323045)