Degrees bounding principles and universal instances in reverse mathematics

DOI10.1016/j.apal.2015.07.003zbMath1372.03027arXiv1411.1599OpenAlexW2963847608MaRDI QIDQ490869

Ludovic Patey

Publication date: 21 August 2015

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsRamsey's theoremuniversal instance

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Other Turing degree structures (03D28)

Related Items (6)

THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS ⋮ Iterative Forcing and Hyperimmunity in Reverse Mathematics ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Controlling iterated jumps of solutions to combinatorial problems ⋮ The weakness of being cohesive, thin or free in reverse mathematics

Cites Work

• Unnamed Item
• Cohesive sets and rainbows
• Primitive recursion and the chain antichain principle
• Ramsey-type graph coloring and diagonal non-computability
• The thin set theorem for pairs implies DNR
• Classical recursion theory. The theory of functions and sets of natural numbers.
• The strength of infinitary Ramseyan principles can be accessed by their densities
• Some logically weak Ramseyan theorems
• On the strength of Ramsey's theorem for pairs
• A Δ₂⁰ set with no infinite low subset in either it or its complement
• THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Slicing the Truth
• Partition Theorems and Computability Theory
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
• Classifying model-theoretic properties
• The atomic model theorem and type omitting
• The strength of the rainbow Ramsey Theorem
• A cohesive set which is not high
• Reverse mathematics and a Ramsey-type König's Lemma
• Random reals, the rainbow Ramsey theorem, and arithmetic conservation
• The finite intersection principle and genericity
• SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: Degrees bounding principles and universal instances in reverse mathematics