Pages that link to "Item:Q5855746"
From MaRDI portal
The following pages link to SEARCHING FOR AN ANALOGUE OF ATR<sub>0</sub> IN THE WEIHRAUCH LATTICE (Q5855746):
Displaying 12 items.
- Embeddings between well-orderings: computability-theoretic reductions (Q1987213) (← links)
- The computational strength of matchings in countable graphs (Q2672158) (← links)
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) (Q2693002) (← links)
- THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE (Q5000272) (← links)
- A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES (Q5021923) (← links)
- Reverse mathematics and Weihrauch analysis motivated by finite complexity theory (Q5037213) (← links)
- ON THE UNCOUNTABILITY OF (Q5052009) (← links)
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS (Q5159502) (← links)
- Algebraic properties of the first-order part of a problem (Q6040614) (← links)
- Notes on overt choice (Q6146824) (← links)
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective (Q6201447) (← links)
- Searching problems above arithmetical transfinite recursion (Q6584960) (← links)
