A packed Ramsey’s theorem and computability theory

DOI10.1090/S0002-9947-2015-06164-9zbMath1371.03095arXiv1302.2256MaRDI QIDQ5247024

Stephen Flood

Publication date: 22 April 2015

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.2256

zbMATH Keywords

computability theoryreverse mathematicsRamsey's theorem

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)

Related Items (1)

On the logical strengths of partial solutions to mathematical problems

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial set theory: Partition relations for cardinals
• Some Ramsey-type theorems
• On the strength of Ramsey's theorem for pairs
• Turing Computability
• RT₂² does not imply WKL₀
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
• Reverse mathematics and a Ramsey-type König's Lemma
• Ramsey's theorem and recursion theory

This page was built for publication: A packed Ramsey’s theorem and computability theory