Pages that link to "Item:Q2933680"
From MaRDI portal
The following pages link to COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY (Q2933680):
Displaying 6 items.
- Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies (Q2207013) (← links)
- Universality for left-computably enumerable metric spaces (Q2263106) (← links)
- On the degree structure of equivalence relations under computable reducibility (Q2295742) (← links)
- Weakly precomplete equivalence relations in the Ershov hierarchy (Q2300735) (← links)
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
