Recommendations
Cites work
- scientific article; zbMATH DE number 3536056 (Why is no real title available?)
- scientific article; zbMATH DE number 841090 (Why is no real title available?)
- scientific article; zbMATH DE number 3316918 (Why is no real title available?)
- A criterion for completeness of degrees of unsolvability
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- The Baire category theorem in weak subsystems of second-order arithmetic
- The theory of \(\kappa\)-like models of arithmetic
Cited in
(91)- On the indecomposability of \(\omega^n\)
- Computing sets from all infinite subsets
- On the logical strengths of partial solutions to mathematical problems
- Reverse mathematics and a Ramsey-type König's lemma
- The definability strength of combinatorial principles
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
- On the strength of Ramsey's theorem for pairs
- The polarized Ramsey's theorem
- scientific article; zbMATH DE number 3916272 (Why is no real title available?)
- Where pigeonhole principles meet Koenig lemmas
- Relationships between computability-theoretic properties of problems
- \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
- Strong reductions between combinatorial principles
- Dickson's lemma and weak Ramsey theory
- A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\)
- Using Ramsey's theorem once
- On the uniform computational content of Ramsey's theorem
- Some Questions in Computable Mathematics
- Automorphism groups of arithmetically saturated models
- 1998 European Summer Meeting of the Association for Symbolic Logic
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- In search of the first-order part of Ramsey's theorem for pairs
- Generics for computable Mathias forcing
- Some logically weak Ramseyan theorems
- Weaker cousins of Ramsey's theorem over a weak base theory
- Infinite dimensional proper subspaces of computable vector spaces
- Cone avoiding closed sets
- On the strength of Ramsey's theorem without \(\Sigma _{1}\)-induction
- Ramsey's theorem for pairs and \(k\) colors as a sub-classical principle of arithmetic
- Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
- Controlling iterated jumps of solutions to combinatorial problems
- Thin set theorems and cone avoidance
- Partition Theorems and Computability Theory
- Coloring the rationals in reverse mathematics
- Partial orders and immunity in reverse mathematics
- Term extraction and Ramsey's theorem for pairs
- A miniaturisation of Ramsey's theorem
- The strength of Ramsey's theorem for coloring relatively large sets
- Unprovable Ramsey-type statements reformulated to talk about primes
- Forcing in Proof Theory
- Ramsey's theorem and cone avoidance
- Dominating the Erdős-Moser theorem in reverse mathematics
- \({\Pi^1_2}\)-comprehension and the property of Ramsey
- The weakness of the pigeonhole principle under hyperarithmetical reductions
- Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
- Coloring trees in reverse mathematics
- \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
- Erdős-Moser and \(I \Sigma_2\)
- The coding power of a product of partitions
- Ramsey-like theorems and moduli of computation
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
- (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE
- Pigeons do not jump high
- The strength of the rainbow Ramsey Theorem
- Thin set versions of Hindman's theorem
- \(\Pi\frac12\)-comprehension and the property of Ramsey
- Sets without subsets of higher many-one degree
- An inside/outside Ramsey theorem and recursion theory
- The strength of the tree theorem for pairs in reverse mathematics
- Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- The strength of Ramsey's theorem for pairs over trees. I: Weak König's lemma
- Peano Arithmetic and Hyper-Ramsey Logic
- The Ginsburg-Sands theorem and computability theory
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- The canonical Ramsey theorem and computability theory
- Ordinal analysis and the infinite Ramsey theorem
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
- Genericity for Mathias forcing over general Turing ideals
- The weakness of being cohesive, thin or free in reverse mathematics
- Cohesive avoidance and strong reductions
- The thin set theorem for pairs implies DNR
- Independence of Ramsey theorem variants using \(\varepsilon _0\)
- Ramsey theorem for pairs as a classical principle in intuitionistic arithmetic
- On the strength of Ramsey's theorem for trees
- On the Ramseyan factorization theorem
- The inductive strength of Ramsey's theorem for pairs
- Open questions about Ramsey-type statements in reverse mathematics
- Cappable CEA sets and Ramsey's theorem
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Ramsey's theorem for pairs and provably recursive functions
- A note on Ramsey theorems and Turing jumps
- THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS
- Cohesive sets and rainbows
- The reverse mathematics of wqos and bqos
- The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem
- scientific article; zbMATH DE number 3904585 (Why is no real title available?)
- The strength of infinitary Ramseyan principles can be accessed by their densities
- Ramsey's theorem and products in the Weihrauch degrees
This page was built for publication: On the strength of Ramsey's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913632)
