The canonical Ramsey theorem and computability theory

DOI10.1090/S0002-9947-07-04390-5MaRDI QIDQ5437596zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatoricsRamsey theorycomputability theoryrecursion theoryreverse mathematics

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• scientific article; zbMATH DE number 2236628 (Why is no real title available?)
• A Combinatorial Theorem
• A cohesive set which is not high
• Note on Canonical Partitions
• On Gödel incompleteness and finite combinatorics
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• Ramsey's theorem and recursion theory
• Ramsey's theorem for computably enumerable colorings
• The canonical Ramsey theorem and computability theory
• ∏ 0 1 Classes and Degrees of Theories

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
• Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\)
• A packed Ramsey’s theorem and computability theory
• 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)