THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES

DOI10.1017/jsl.2016.10zbMath1436.03099arXiv1408.1465OpenAlexW2467976395MaRDI QIDQ2976345

Wei Wang

Publication date: 28 April 2017

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.1465

zbMATH Keywords

reverse mathematicsRamsey's theoremthin setfree setrainbow Ramsey theorydefinability strength

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)

Related Items (5)

The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ Extracting randomness within a subset is hard ⋮ Degrees bounding principles and universal instances in reverse mathematics ⋮ Pigeons do not jump high

Cites Work

• Cohesive sets and rainbows
• Turing degrees of certain isomorphic images of computable relations
• On the strength of Ramsey's theorem
• Some logically weak Ramseyan theorems
• Algorithmic Randomness and Complexity
• The atomic model theorem and type omitting
• SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
• Unnamed Item
• Unnamed Item

This page was built for publication: THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES