Partition Theorems and Computability Theory
From MaRDI portal
Publication:3370615
DOI10.2178/bsl/1122038995zbMath1097.03037MaRDI QIDQ3370615
Publication date: 8 February 2006
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1122038995
03B30: Foundations of classical theories (including reverse mathematics)
05D10: Ramsey theory
03D80: Applications of computability and recursion theory
03F35: Second- and higher-order arithmetic and fragments
03D45: Theory of numerations, effectively presented structures
Related Items
Cites Work
- 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
- A Δ20 set with no infinite low subset in either it or its complement
- Note on Canonical Partitions
- Generalized cohesiveness
- A cohesive set which is not high
- Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
- Class groups of integral group rings
- Ramsey's theorem and recursion theory