The canonical Ramsey theorem and computability theory
DOI10.1090/S0002-9947-07-04390-5zbMATH Open1135.03014OpenAlexW2095307184MaRDI QIDQ5437596FDOQ5437596
Authors: Joseph R. Mileti 
Publication date: 21 January 2008
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-07-04390-5
Recommendations
- A packed Ramsey’s theorem and computability theory
- Ramsey-like theorems and moduli of computation
- On the uniform computational content of Ramsey's theorem
- Ramsey's theorem for singletons and strong computable reducibility
- scientific article; zbMATH DE number 4200143
- On the Canonical Version of a Theorem in Ramsey Theory
- A Canonical Ramsey Theorem
- SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
- Canonizing structural Ramsey theorems
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- ∏ 0 1 Classes and Degrees of Theories
- A Combinatorial Theorem
- On Gödel incompleteness and finite combinatorics
- On the strength of Ramsey's theorem for pairs
- Title not available (Why is that?)
- A cohesive set which is not high
- Ramsey's theorem and recursion theory
- Title not available (Why is that?)
- On the strength of Ramsey's theorem
- Title not available (Why is that?)
- The canonical Ramsey theorem and computability theory
- Note on Canonical Partitions
- Ramsey's theorem for computably enumerable colorings
Cited In (12)
- Relationships between computability-theoretic properties of problems
- (Un)countable and (non)effective versions of Ramsey's theorem
- The diversity of minimal cofinal extensions
- Partition Theorems and Computability Theory
- A packed Ramsey’s theorem and computability theory
- Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\)
- Combinatorial unprovability proofs and their model-theoretic counterparts
- The strength of the rainbow Ramsey Theorem
- The finite intersection principle and genericity
- The canonical Ramsey theorem and computability theory
- Binary subtrees with few labeled paths
- On the canonical Ramsey theorem of Erdős and Rado and Ramsey ultrafilters
This page was built for publication: The canonical Ramsey theorem and computability theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437596)
