Pages that link to "Item:Q5939996"
From MaRDI portal
The following pages link to Computably enumerable equivalence relations (Q5939996):
Displaying 36 items.
- \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures (Q639658) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- On dark computably enumerable equivalence relations (Q1642296) (← links)
- Jumps of computably enumerable equivalence relations (Q1693042) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- Positive preorders (Q1757648) (← links)
- Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
- Completeness of the hyperarithmetic isomorphism equivalence relation (Q2143655) (← links)
- Special classes of positive preorders (Q2145061) (← links)
- Index sets for classes of positive preorders (Q2165608) (← links)
- The theory of ceers computes true arithmetic (Q2187270) (← links)
- Classifying equivalence relations in the Ershov hierarchy (Q2204368) (← links)
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies (Q2207013) (← links)
- The structure of computably enumerable preorder relations (Q2213931) (← links)
- On computably enumerable structures (Q2263114) (← links)
- On the degree structure of equivalence relations under computable reducibility (Q2295742) (← links)
- Weakly precomplete equivalence relations in the Ershov hierarchy (Q2300735) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- Boolean algebras realized by c.e. equivalence relations (Q2403654) (← links)
- On universal positive graphs (Q2687461) (← links)
- Weakly precomplete computably enumerable equivalence relations (Q2793914) (← links)
- A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971) (← links)
- FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS (Q2976331) (← links)
- THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2976337) (← links)
- On Σ<sup>1</sup> <sub>1</sub> equivalence relations over the natural numbers (Q3117786) (← links)
- LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS (Q3188324) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- INITIAL SEGMENTS OF THE DEGREES OF CEERS (Q5100062) (← links)
- ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q5107218) (← links)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- Agreement reducibility (Q6047663) (← links)
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
- Word problems and ceers (Q6096328) (← links)
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR (Q6103452) (← links)
- Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
- Computable reducibility for computable linear orders of type \(\omega \) (Q6187991) (← links)
