Ramsey's theorem and recursion theory

DOI10.2307/2272972zbMath0262.02042MaRDI QIDQ5677475

Publication date: 1972

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272972

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

03D55: Hierarchies of computability and definability

Related Items

2002 Annual Meeting of the Association for Symbolic Logic, 2000 Annual Meeting of the Association for Symbolic Logic, 2003 Annual Meeting of the Association for Symbolic Logic, Forcing in Proof Theory, An algebraic difference between isols and cosimple isols, 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09, The canonical Ramsey theorem and computability theory, Ramsey's theorem for trees: the polarized tree theorem and notions of stability, Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007, Chains and antichains in partial orderings, The polarized Ramsey's theorem, A dual form of Ramsey's theorem, Ultrafilters and types on models of arithmetic, Countable algebra and set existence axioms, An infinite version of Arrow's theorem in the effective setting, The Galvin-Prikry theorem and set existence axioms, Fast growing functions based on Ramsey theorems, On the strength of König's duality theorem for infinite bipartite graphs, Upward closure and cohesive degrees, Computability-theoretic and proof-theoretic aspects of partial and linear orderings, Infinite chains and antichains in computable partial Orderings, Partition Theorems and Computability Theory, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, The atomic model theorem and type omitting, Recursive Euler and Hamilton Paths, 1998 European Summer Meeting of the Association for Symbolic Logic

Cites Work