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 16 items.
- Positive preorders (Q1757648) (← links)
- Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
- Index sets for classes of positive preorders (Q2165608) (← 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)
- FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS (Q2976331) (← links)
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS (Q5027663) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- (Q5094125) (← links)
- Measuring the complexity of reductions between equivalence relations (Q5211066) (← links)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- Logical Approaches to Computational Barriers (Q5898805) (← links)
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR (Q6103452) (← links)