Pages that link to "Item:Q3174640"
From MaRDI portal
The following pages link to Open Questions in Reverse Mathematics (Q3174640):
Displayed 30 items.
- On the strength of the finite intersection principle (Q375889) (← links)
- Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
- The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
- The computability, definability, and proof theory of Artinian rings (Q1628418) (← links)
- Refining the taming of the reverse mathematics zoo (Q1633897) (← links)
- Reverse mathematics and parameter-free transfer (Q1634526) (← links)
- A weak variant of Hindman's theorem stronger than Hilbert's theorem (Q1745357) (← links)
- New bounds on the strength of some restrictions of Hindman's theorem (Q2011655) (← links)
- Splittings and disjunctions in reverse mathematics (Q2176407) (← links)
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs (Q2193942) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- Pincherle's theorem in reverse mathematics and computability theory (Q2304540) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- Determinacy and monotone inductive definitions (Q2631880) (← links)
- The reverse mathematics of the Tietze extension theorem (Q2827383) (← links)
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS (Q2976336) (← links)
- STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES (Q2976339) (← links)
- The Reverse Mathematics of wqos and bqos (Q3295152) (← links)
- “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem (Q4596010) (← links)
- On the logical strengths of partial solutions to mathematical problems (Q4642696) (← links)
- A computable analysis of variable words theorems (Q4644466) (← links)
- Computable aspects of the Bachmann–Howard principle (Q5118047) (← links)
- A categorical construction of Bachmann–Howard fixed points (Q5205443) (← links)
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS (Q5207560) (← links)
- Thin set theorems and cone avoidance (Q5218249) (← links)
- On the mathematical and foundational significance of the uncountable (Q5223120) (← links)
- ON IDEMPOTENT ULTRAFILTERS IN HIGHER-ORDER REVERSE MATHEMATICS (Q5251363) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (Q5366979) (← links)