CAPPABLE CEA SETS AND RAMSEY'S THEOREM

DOI10.1142/9789814360548_0007zbMath1280.03041OpenAlexW2136997084MaRDI QIDQ4922663

Asher M. Kach, D. Reed Solomon, Manuel Lerman

Publication date: 3 June 2013

Published in: Proceedings of the 11th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789814360548_0007

zbMATH Keywords

reverse mathematicsTuring degreesRamsey's theorem for pairscomputable stable coloring of pairs

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Set-theoretic model theory (03C55)

This page was built for publication: CAPPABLE CEA SETS AND RAMSEY'S THEOREM