Pages that link to "Item:Q5211066"
From MaRDI portal
The following pages link to Measuring the complexity of reductions between equivalence relations (Q5211066):
Displayed 4 items.
- Classifying equivalence relations in the Ershov hierarchy (Q2204368) (← links)
- Computing sets from all infinite subsets (Q5158110) (← links)
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
- Word problems and ceers (Q6096328) (← links)