The canonical Ramsey theorem and computability theory
From MaRDI portal
Publication:5437596
DOI10.1090/S0002-9947-07-04390-5zbMath1135.03014OpenAlexW2095307184MaRDI QIDQ5437596
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
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
On the canonical Ramsey theorem of Erdős and Rado and Ramsey ultrafilters, The finite intersection principle and genericity, Binary subtrees with few labeled paths, Combinatorial unprovability proofs and their model-theoretic counterparts, The canonical Ramsey theorem and computability theory, Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\), The strength of the rainbow Ramsey Theorem, The diversity of minimal cofinal extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 for computably enumerable colorings
- Note on Canonical Partitions
- A cohesive set which is not high
- The canonical Ramsey theorem and computability theory
- ∏ 0 1 Classes and Degrees of Theories
- Ramsey's theorem and recursion theory
- A Combinatorial Theorem
