On the logical strengths of partial solutions to mathematical problems

DOI10.1112/tlm3.12001zbMath1453.03002arXiv1411.5874OpenAlexW1461336424WikidataQ59886240 ScholiaQ59886240MaRDI QIDQ4642696

Paul Shafer, Ludovic Patey, Laurent Bienvenu

Publication date: 25 May 2018

Published in: Transactions of the London Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

Partial Orders and Immunity in Reverse Mathematics, RANDOMNESS NOTIONS AND REVERSE MATHEMATICS, The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem, COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the strength of the finite intersection principle
• The weakness of being cohesive, thin or free in reverse mathematics
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• Ramsey-type graph coloring and diagonal non-computability
• Infinite subsets of random sets of integers
• Some Ramsey-type theorems
• On the strength of Ramsey's theorem
• The strength of infinitary Ramseyan principles can be accessed by their densities
• Some logically weak Ramseyan theorems
• Measure theory and weak König's lemma
• On the strength of Ramsey's theorem for pairs
• RT₂² does not imply WKL₀
• Separating principles below
• THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS
• Algorithmic Randomness and Complexity
• Open Questions in Reverse Mathematics
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Iterative Forcing and Hyperimmunity in Reverse Mathematics
• Partition Theorems and Computability Theory
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Lowness for Kurtz randomness
• The atomic model theorem and type omitting
• Π₁⁰ classes and Boolean combinations of recursively enumerable sets
• Reverse mathematics and a Ramsey-type König's Lemma
• A packed Ramsey’s theorem and computability theory
• Comparing DNR and WWKL
• SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
• Cone avoiding closed sets