Open Questions in Reverse Mathematics
From MaRDI portal
Publication:3174640
DOI10.2178/bsl/1309952320zbMath1233.03023WikidataQ126081666 ScholiaQ126081666MaRDI QIDQ3174640
Publication date: 11 October 2011
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5a88c5dc085f02a0cb991f5e89358e2172a3aea2
03B30: Foundations of classical theories (including reverse mathematics)
03F35: Second- and higher-order arithmetic and fragments
Related Items
“Weak yet strong” restrictions of Hindman’s Finite Sums Theorem, On the logical strengths of partial solutions to mathematical problems, A computable analysis of variable words theorems, Computable aspects of the Bachmann–Howard principle, A categorical construction of Bachmann–Howard fixed points, COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS, Thin set theorems and cone avoidance, On the mathematical and foundational significance of the uncountable, ON IDEMPOTENT ULTRAFILTERS IN HIGHER-ORDER REVERSE MATHEMATICS, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem, On the strength of the finite intersection principle, Infinite dimensional proper subspaces of computable vector spaces, The weakness of being cohesive, thin or free in reverse mathematics, The computability, definability, and proof theory of Artinian rings, Refining the taming of the reverse mathematics zoo, Reverse mathematics and parameter-free transfer, A weak variant of Hindman's theorem stronger than Hilbert's theorem, New bounds on the strength of some restrictions of Hindman's theorem, Splittings and disjunctions in reverse mathematics, Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs, \(\Pi_1^1\)-comprehension as a well-ordering principle, Pincherle's theorem in reverse mathematics and computability theory, Dominating the Erdős-Moser theorem in reverse mathematics, Coloring trees in reverse mathematics, Determinacy and monotone inductive definitions, The reverse mathematics of the Tietze extension theorem, ON THE STRENGTH OF TWO RECURRENCE THEOREMS, STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES, The Reverse Mathematics of wqos and bqos
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability
- Patterns of resemblance of order 2
- The polarized Ramsey's theorem
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- A dual form of Ramsey's theorem
- Countable algebra and set existence axioms
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- Proof-theoretic investigations on Kruskal's theorem
- Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic
- Reverse mathematics and ordinal exponentiation
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Some unifying principles in Ramsey theory
- A note on the theory of positive induction, \({{\text{ID}}^*_1}\)
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- On Fraissé's order type conjecture
- Measure theory and weak König's lemma
- On the strength of Ramsey's theorem for pairs
- Chain conditions in computable rings
- Groundwork for weak analysis
- Uniform versions of some axioms of second order arithmetic
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
- Reverse mathematics, computability, and partitions of trees
- Determinacy of Wadge classes and subsystems of second order arithmetic
- Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
- Π12-logic, Part 1: Dilators
- Located sets and reverse mathematics
- Infinite games in the Cantor space and subsystems of second order arithmetic
- Δ3O-determinacy, comprehension and induction
- Assignment of ordinals to patterns of resemblance
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- Comparing DNR and WWKL
- Hindman's theorem, ultrafilters, and reverse mathematics
- Ranked structures and arithmetic transfinite recursion
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Class groups of integral group rings
- Ramsey's theorem and recursion theory
- Up to equimorphism, hyperarithmetic is recursive
