Recommendations
Cites work
- scientific article; zbMATH DE number 4033738 (Why is no real title available?)
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 2236640 (Why is no real title available?)
- A dual form of Ramsey's theorem
- A note on the theory of positive induction, \({{\text{ID}}^*_1}\)
- Assignment of ordinals to patterns of resemblance
- Chain conditions in computable rings
- Class groups of integral group rings
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Comparing DNR and WWKL
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Corrigendum to: ``On the strength of Ramsey's theorem for pairs
- Countable algebra and set existence axioms
- Determinacy of Wadge classes and subsystems of second order arithmetic
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- Groundwork for weak analysis
- Hindman's theorem, ultrafilters, and reverse mathematics
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Infinite games in the Cantor space and subsystems of second order arithmetic
- Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic
- Located sets and reverse mathematics
- Measure theory and weak König's lemma
- On Fraissé's order type conjecture
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
- On the strength of Ramsey's theorem for pairs
- Patterns of resemblance of order 2
- Proof-theoretic investigations on Kruskal's theorem
- Ramsey's theorem and recursion theory
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability
- Ranked structures and arithmetic transfinite recursion
- Reverse mathematics and ordinal exponentiation
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- Reverse mathematics, computability, and partitions of trees
- Some unifying principles in Ramsey theory
- Subsystems of second order arithmetic
- The Bachmann-Howard structure in terms of _1-elementarity
- The polarized Ramsey's theorem
- Uniform versions of some axioms of second order arithmetic
- Up to equimorphism, hyperarithmetic is recursive
- Δ3O-determinacy, comprehension and induction
- Π12-logic, Part 1: Dilators
Cited in
(65)- Splittings and disjunctions in reverse mathematics
- scientific article; zbMATH DE number 3930980 (Why is no real title available?)
- On the logical strengths of partial solutions to mathematical problems
- Nets and reverse mathematics
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- Computability theory, nonstandard analysis, and their connections
- Reverse mathematics of the uncountability of \(\mathbb{R}\)
- On the logical strength of the better quasi order with three elements
- The reverse mathematics of the Tietze extension theorem
- Reverse Mathematics and Π12 Comprehension
- Strong reductions between combinatorial principles
- 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
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- A weak variant of Hindman's theorem stronger than Hilbert's theorem
- Halin's infinite ray theorems: complexity and reverse mathematics
- The biggest five of reverse mathematics
- Infinite dimensional proper subspaces of computable vector spaces
- ON IDEMPOTENT ULTRAFILTERS IN HIGHER-ORDER REVERSE MATHEMATICS
- Sometimes tame, sometimes wild: weak continuity
- scientific article; zbMATH DE number 1531925 (Why is no real title available?)
- Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
- New bounds on the strength of some restrictions of Hindman's theorem
- The computability, definability, and proof theory of Artinian rings
- A computable analysis of variable words theorems
- Reverse mathematics and parameter-free transfer
- Determinacy and monotone inductive definitions
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
- A categorical construction of Bachmann–Howard fixed points
- The metamathematics of separated determinacy
- Thin set theorems and cone avoidance
- Hybrid maximal filter spaces
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- Reverse formalism 16
- Big in reverse mathematics: the uncountability of the reals
- Questions inspired by Mikael Passare's mathematics
- Dominating the Erdős-Moser theorem in reverse mathematics
- Hindman's theorem for sums along the full binary tree, ^0_2-induction and the pigeonhole principle for trees
- On the strength of the finite intersection principle
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
- Infinite games in the Cantor space and subsystems of second order arithmetic
- scientific article; zbMATH DE number 841096 (Why is no real title available?)
- Coloring trees in reverse mathematics
- Big in reverse mathematics: measure and category
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- Computable aspects of the Bachmann-Howard principle
- Pure \(\Sigma_2\)-elementarity beyond the core
- Patterns of resemblance and Bachmann-Howard fixed points
- On the mathematical and foundational significance of the uncountable
- The weakness of being cohesive, thin or free in reverse mathematics
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- A recursive coloring function without _3⁰ solutions for Hindman's theorem
- Higman's lemma is stronger for better quasi orders
- Open questions about Ramsey-type statements in reverse mathematics
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Countable sets versus sets that are countable in reverse mathematics
- The computational content of nonstandard analysis
- THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS
- The reverse mathematics of wqos and bqos
- 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)
