Recommendations
- Thin set versions of Hindman's theorem
- Two counterexamples to Cornea's conjecture on thin sets
- scientific article; zbMATH DE number 3918803
- Thin-type dense sets and related properties
- Publication:4955580
- A non-splitting theorem for d.r.e. sets
- Hua's theorem in thin subset
- On thin, very thin, and slim dense sets
- The size of some classes of thin sets
- Strict-2-associatedness for thin sets
Cites work
- scientific article; zbMATH DE number 2236628 (Why is no real title available?)
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- On the density of families of sets
- On the strength of Ramsey's theorem
- On the strength of Ramsey's theorem for pairs
- Some logically weak Ramseyan theorems
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
- The atomic model theorem and type omitting
- \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
Cited in
(7)- Relationships between computability-theoretic properties of problems
- The weakness of the pigeonhole principle under hyperarithmetical reductions
- DNR and incomparable Turing degrees
- Degrees bounding principles and universal instances in reverse mathematics
- Iterative forcing and hyperimmunity in reverse mathematics
- Pigeons do not jump high
- Filters on computable posets
This page was built for publication: The thin set theorem for pairs implies DNR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894259)
