Ramsey's theorem for computably enumerable colorings
From MaRDI portal
Publication:2747723
DOI10.2307/2695050zbMath0988.03066OpenAlexW2121293617MaRDI QIDQ2747723
Tamara J. Hummel, Carl G. jun. Jockusch
Publication date: 14 July 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695050
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Related Items
The canonical Ramsey theorem and computability theory ⋮ 2002 Annual Meeting of the Association for Symbolic Logic
Cites Work