COH, SRT 2 2 , and multiple functionals
From MaRDI portal
Recommendations
- Ramsey's theorem for singletons and strong computable reducibility
- Strong reductions between combinatorial principles
- Cohesive avoidance and strong reductions
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
- Some results concerning the \(\mathsf{SRT}_2^2\) vs. \(\mathsf{COH}\) problem
Cites work
- \({\Pi}_1^0\)-encodability and omniscient reductions
- Cohesive avoidance and strong reductions
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- On notions of computability-theoretic reduction between Π21 principles
- On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
- On the strength of Ramsey's theorem for pairs
- On the uniform computational content of Ramsey's theorem
- On uniform relationships between combinatorial problems
- Partial orders and immunity in reverse mathematics
- Ramsey's theorem and products in the Weihrauch degrees
- Ramsey's theorem for singletons and strong computable reducibility
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Strong reductions between combinatorial principles
- Subsystems of second order arithmetic
- The Vitali Covering Theorem in the Weihrauch Lattice
- The weakness of being cohesive, thin or free in reverse mathematics
- Turing computability. Theory and applications
- Using Ramsey's theorem once
Cited in
(2)
This page was built for publication: COH, SRT 2 2 , and multiple functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995606)
