Where pigeonhole principles meet Koenig lemmas

DOI10.1090/tran/8494OpenAlexW3197943137MaRDI QIDQ5158115

No author found.

Publication date: 21 October 2021

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

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Algorithmic randomness and dimension (03D32)

Related Items

HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The inductive strength of Ramsey's theorem for pairs
• Exponential lower bounds for the pigeonhole principle
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• A model-theoretic characterization of the weak pigeonhole principle
• The theory of \(\kappa\)-like models of arithmetic
• On the strength of Ramsey's theorem
• Measure theory and weak König's lemma
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Automorphisms of models of bounded arithmetic
• The Pigeonhole Principle and Fragments of Arithmetic
• Closure properties of countable non-standard integers
• Provability of the pigeonhole principle and the existence of infinitely many primes
• A feasible theory for analysis
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
• Random reals, the rainbow Ramsey theorem, and arithmetic conservation
• Reverse mathematics and Ramsey's property for trees
• On the computability of perfect subsets of sets with positive measure