On the strength of Ramsey's theorem
From MaRDI portal
Publication:1913632
DOI10.1305/ndjfl/1040136917zbMath0843.03034OpenAlexW2016125425MaRDI QIDQ1913632
David Seetapun, Theodore A. Slaman
Publication date: 22 May 1996
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1040136917
Related Items
An inside/outside Ramsey theorem and recursion theory, 1998 European Summer Meeting of the Association for Symbolic Logic, RT22 does not imply WKL0, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, Term extraction and Ramsey's theorem for pairs, Partial Orders and Immunity in Reverse Mathematics, The metamathematics of Stable Ramsey’s Theorem for Pairs, RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS, RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION, THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS, THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS, Dominating the Erdős-Moser theorem in reverse mathematics, Coloring trees in reverse mathematics, Cohesive sets and rainbows, Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles, On the strength of Ramsey's theorem for trees, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Infinite dimensional proper subspaces of computable vector spaces, The thin set theorem for pairs implies DNR, HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?, A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\), The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem, Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs, The coding power of a product of partitions, ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM, Controlling iterated jumps of solutions to combinatorial problems, Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective, (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE, Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem, Some Questions in Computable Mathematics, STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES, THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS, THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES, Generics for computable Mathias forcing, Some logically weak Ramseyan theorems, The Reverse Mathematics of wqos and bqos, Reverse mathematics and a Ramsey-type König's Lemma, On the strength of Ramsey's theorem for pairs, On the logical strengths of partial solutions to mathematical problems, Genericity for Mathias forcing over general Turing ideals, The weakness of being cohesive, thin or free in reverse mathematics, Computing sets from all infinite subsets, Where pigeonhole principles meet Koenig lemmas, The weakness of the pigeonhole principle under hyperarithmetical reductions, Random reals, the rainbow Ramsey theorem, and arithmetic conservation, On the indecomposability of \(\omega^n\), Forcing in Proof Theory, The canonical Ramsey theorem and computability theory, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, Partition Theorems and Computability Theory, \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models, The polarized Ramsey's theorem, Ramsey's theorem and cone avoidance, Thin set theorems and cone avoidance, Automorphism groups of arithmetically saturated models, Pigeons do not jump high, The strength of the rainbow Ramsey Theorem, Cohesive avoidance and strong reductions, Cone avoiding closed sets, Sets without subsets of higher many-one degree, The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma, Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom, Thin set versions of Hindman's theorem, In search of the first-order part of Ramsey's theorem for pairs
Cites Work
