Pages that link to "Item:Q1987213"

The following pages link to Embeddings between well-orderings: computability-theoretic reductions (Q1987213):

Displaying 3 items.

• 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₀ IN THE WEIHRAUCH LATTICE (Q5855746) (← links)