Pages that link to "Item:Q1987213"
From MaRDI portal
The following pages link to Embeddings between well-orderings: computability-theoretic reductions (Q1987213):
Displaying 5 items.
- Weak comparability of well orderings and reverse mathematics (Q918549) (← links)
- Equivalence between Fraïssé's conjecture and Jullien's theorem (Q2368905) (← links)
- The computational strength of matchings in countable graphs (Q2672158) (← links)
- THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE (Q5000272) (← links)
- SEARCHING FOR AN ANALOGUE OF ATR<sub>0</sub> IN THE WEIHRAUCH LATTICE (Q5855746) (← links)