Combinatorial principles weaker than Ramsey's Theorem for pairs
From MaRDI portal
Publication:3426570
DOI10.2178/jsl/1174668391zbMath1118.03055OpenAlexW2144268026MaRDI QIDQ3426570
Denis R. Hirschfeldt, Richard A. Shore
Publication date: 12 March 2007
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1174668391
Combinatorics of partially ordered sets (06A07) Other combinatorial set theory (03E05) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)
Related Items
An inside/outside Ramsey theorem and recursion theory, Reverse Mathematics: The Playground of Logic, Open Questions in Reverse Mathematics, Reverse mathematical bounds for the termination theorem, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, Term extraction and Ramsey's theorem for pairs, Computable Reductions and Reverse Mathematics, Partial Orders and Immunity in Reverse Mathematics, RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION, THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS, Iterative Forcing and Hyperimmunity in Reverse Mathematics, NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS, The uniform content of partial and linear orders, Dominating the Erdős-Moser theorem in reverse mathematics, Coloring trees in reverse mathematics, The reverse mathematics of non-decreasing subsequences, On the strength of the finite intersection principle, Cohesive sets and rainbows, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Ramsey’s theorem for singletons and strong computable reducibility, Infinite dimensional proper subspaces of computable vector spaces, The thin set theorem for pairs implies DNR, Constant regions in models of arithmetic, ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS, A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\), Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs, Variations of statement, variations of strength. The case of the Rival-Sands theorems, (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE, The maximal linear extension theorem in second order arithmetic, Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem, On the jumps of the degrees below a recursively enumerable degree, Primitive recursion and the chain antichain principle, \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs, Herrmann’s Beautiful Theorem on Computable Partial Orderings, Strength and Weakness in Computable Structure Theory, Some Questions in Computable Mathematics, 2007 Annual Meeting of the Association for Symbolic Logic, Domination, forcing, array nonrecursiveness and relative recursive enumerability, Some logically weak Ramseyan theorems, The Reverse Mathematics of wqos and bqos, On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics, Weaker cousins of Ramsey's theorem over a weak base theory, Degrees bounding principles and universal instances in reverse mathematics, SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS, The cohesive principle and the Bolzano-Weierstraß principle, On the logical strengths of partial solutions to mathematical problems, The weakness of being cohesive, thin or free in reverse mathematics, Necessary use of induction in a reversal, FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS, Ramsey's theorem for trees: the polarized tree theorem and notions of stability, On the indecomposability of \(\omega^n\), On uniform relationships between combinatorial problems, On a question of Andreas Weiermann, \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models, The polarized Ramsey's theorem, Stability and posets, The atomic model theorem and type omitting, Bounding non-GL2 and R.E.A., Constructing sequences one step at a time, The strength of the rainbow Ramsey Theorem, 2009 North American Annual Meeting of the Association for Symbolic Logic, Cohesive avoidance and strong reductions, A packed Ramsey’s theorem and computability theory, 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, Linear extensions of partial orders and reverse mathematics, In search of the first-order part of Ramsey's theorem for pairs
Cites Work
