On uniform relationships between combinatorial problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 125198
- scientific article; zbMATH DE number 3116601
- scientific article; zbMATH DE number 4213934
- On the algebraic structure of combinatorial problems
- scientific article; zbMATH DE number 3685503
- scientific article; zbMATH DE number 3561377
- scientific article; zbMATH DE number 3365270
- Combinatorial aspects of relations
- scientific article; zbMATH DE number 827999
- The unity of combinatorics
Cites work
- ∏ 0 1 Classes and Degrees of Theories
- A proof of Beigel's cardinality conjecture
- Algorithmic randomness and complexity.
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
- Closed choice and a uniform low basis theorem
- Cohesive avoidance and strong reductions
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Comparing DNR and WWKL
- Countable algebra and set existence axioms
- scientific article; zbMATH DE number 4135927 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 786487 (Why is no real title available?)
- scientific article; zbMATH DE number 7311152 (Why is no real title available?)
- scientific article; zbMATH DE number 2236628 (Why is no real title available?)
- Measure theory and weak König's lemma
- On notions of computability-theoretic reduction between Π21 principles
- On the (semi)lattices induced by continuous reducibilities
- On the strength of Ramsey's theorem for pairs
- Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom
- Ramsey's theorem and cone avoidance
- Ramsey's theorem and recursion theory
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- Representations of Reals in Reverse Mathematics
- Separating principles below Ramsey's theorem for pairs
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Some logically weak Ramseyan theorems
- Subsystems of second order arithmetic
- Term extraction and Ramsey's theorem for pairs
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- The strength of the rainbow Ramsey Theorem
- Weihrauch degrees, omniscience principles and weak computability
Cited in
(55)- On the uniform computational content of the Baire category theorem
- A topological view on algebraic computation models
- On the uniform computational content of computability theory
- Embeddings between well-orderings: computability-theoretic reductions
- \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
- Highness properties close to PA completeness
- Parallelizations in Weihrauch reducibility and constructive reverse mathematics
- Restrictions of Hindman's theorem: an overview
- Using Ramsey's theorem once
- Pincherle's theorem in reverse mathematics and computability theory
- Probabilistic computability and choice
- Universality, optimality, and randomness deficiency
- On the relation between continuous and combinatorial
- The uniform content of partial and linear orders
- Coloring trees in reverse mathematics
- A determinacy approach to Borel combinatorics
- Ramsey's theorem for singletons and strong computable reducibility
- Reverse mathematics of matroids
- The Vitali Covering Theorem in the Weihrauch Lattice
- Many-one reductions and the category of multivalued functions
- Some Questions in Computable Mathematics
- On notions of computability-theoretic reduction between Π21 principles
- Computable reductions and reverse mathematics
- Intuitionistic provability versus uniform provability in \(\mathsf{RCA}\)
- On the algebraic structure of Weihrauch degrees
- On the uniform computational content of Ramsey's theorem
- On Weihrauch reducibility and intuitionistic reverse mathematics
- scientific article; zbMATH DE number 4116532 (Why is no real title available?)
- Ramsey's theorem for pairs and \(k\) colors as a sub-classical principle of arithmetic
- Weihrauch and constructive reducibility between existence statements
- COH, SRT 2 2 , and multiple functionals
- Weihrauch Complexity in Computable Analysis
- The weakness of being cohesive, thin or free in reverse mathematics
- An inside/outside Ramsey theorem and recursion theory
- Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
- Reduction games, provability and compactness
- Ramsey-like theorems and moduli of computation
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Thin set theorems and cone avoidance
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- On the strength of marriage theorems and uniformity
- Algebraic properties of the first-order part of a problem
- On uniform relationships between combinatorial problems
- Erdős-Moser and I _2
- On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
- The reverse mathematics of \textsf{CAC for trees}
- How can a line segment with extension be composed of extensionless points? From Aristotle to Borel, and beyond
- On sequential theorems in reverse mathematics
- Indivisibility and uniform computational strength
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- On arithmetical numberings in reverse mathematics
This page was built for publication: On uniform relationships between combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796522)
