Open questions in reverse mathematics
From MaRDI portal
Publication:3174640
DOI10.2178/BSL/1309952320zbMATH Open1233.03023OpenAlexW2170311001WikidataQ126081666 ScholiaQ126081666MaRDI QIDQ3174640FDOQ3174640
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
Recommendations
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A dual form of Ramsey's theorem
- Some unifying principles in Ramsey theory
- On Fraissé's order type conjecture
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- Hindman's theorem, ultrafilters, and reverse mathematics
- Measure theory and weak König's lemma
- On the strength of Ramsey's theorem for pairs
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Infinite games in the Cantor space and subsystems of second order arithmetic
- Ramsey's theorem and recursion theory
- Title not available (Why is that?)
- Countable algebra and set existence axioms
- Proof-theoretic investigations on Kruskal's theorem
- A note on the theory of positive induction, \({{\text{ID}}^*_1}\)
- Comparing DNR and WWKL
- Chain conditions in computable rings
- Corrigendum to: ``On the strength of Ramsey's theorem for pairs
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Located sets and reverse mathematics
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- Reverse mathematics and ordinal exponentiation
- Title not available (Why is that?)
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- Δ3O-determinacy, comprehension and induction
- Patterns of resemblance of order 2
- Assignment of ordinals to patterns of resemblance
- The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity
- Uniform versions of some axioms of second order arithmetic
- Π12-logic, Part 1: Dilators
- Groundwork for weak analysis
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- The polarized Ramsey's theorem
- Reverse mathematics, computability, and partitions of trees
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability
- Ranked structures and arithmetic transfinite recursion
- Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic
- Up to equimorphism, hyperarithmetic is recursive
- Class groups of integral group rings
- Determinacy of Wadge classes and subsystems of second order arithmetic
Cited In (57)
- On the logical strength of the better quasi order with three elements
- On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
- Higman's lemma is stronger for better quasi orders
- Splittings and disjunctions in reverse mathematics
- Title not available (Why is that?)
- On the logical strengths of partial solutions to mathematical problems
- Nets and reverse mathematics
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- Reverse mathematics of the uncountability of \(\mathbb{R}\)
- Reverse Mathematics and Π12 Comprehension
- The reverse mathematics of the Tietze extension theorem
- A Glimpse of $$ \sum_{3} $$-elementarity
- Restrictions of Hindman's theorem: an overview
- Representations and the foundations of mathematics
- Refining the taming of the reverse mathematics zoo
- ON IDEMPOTENT ULTRAFILTERS IN HIGHER-ORDER REVERSE MATHEMATICS
- A weak variant of Hindman's theorem stronger than Hilbert's theorem
- Infinite dimensional proper subspaces of computable vector spaces
- Title not available (Why is that?)
- The Reverse Mathematics of wqos and bqos
- New bounds on the strength of some restrictions of Hindman's theorem
- A computable analysis of variable words theorems
- The computability, definability, and proof theory of Artinian rings
- Computable aspects of the Bachmann–Howard principle
- Reverse mathematics and parameter-free transfer
- A categorical construction of Bachmann–Howard fixed points
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- Determinacy and monotone inductive definitions
- Thin set theorems and cone avoidance
- STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- Reverse formalism 16
- Dominating the Erdős-Moser theorem in reverse mathematics
- Questions inspired by Mikael Passare's mathematics
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees
- Title not available (Why is that?)
- Infinite games in the Cantor space and subsystems of second order arithmetic
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
- On the strength of the finite intersection principle
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
- Title not available (Why is that?)
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
- Coloring trees in reverse mathematics
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
- “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
- Pure \(\Sigma_2\)-elementarity beyond the core
- On the mathematical and foundational significance of the uncountable
- Patterns of resemblance and Bachmann-Howard fixed points
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- The weakness of being cohesive, thin or free in reverse mathematics
- THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- Countable sets versus sets that are countable in reverse mathematics
- THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS
- Reverse mathematics of topology: dimension, paracompactness, and splittings
- Pincherle's theorem in reverse mathematics and computability theory
This page was built for publication: Open questions in reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174640)
