Pages that link to "Item:Q1693042"
From MaRDI portal
The following pages link to Jumps of computably enumerable equivalence relations (Q1693042):
Displaying 10 items.
- The theory of ceers computes true arithmetic (Q2187270) (← links)
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies (Q2207013) (← links)
- The structure of computably enumerable preorder relations (Q2213931) (← links)
- Weakly precomplete equivalence relations in the Ershov hierarchy (Q2300735) (← links)
- Strong jump-traceability. I: The computably enumerable case (Q2474313) (← links)
- Uniformly computably separable algebras with effectively splittable families of negative congruences (Q2671977) (← links)
- Universal computably enumerable equivalence relations (Q2921020) (← links)
- Fixpoints and relative precompleteness (Q5075519) (← links)
- ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q5107218) (← links)
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR (Q6103452) (← links)