Pages that link to "Item:Q2970971"
From MaRDI portal
The following pages link to A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971):
Displayed 25 items.
- On dark computably enumerable equivalence relations (Q1642296) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- The category of equivalence relations (Q2066097) (← links)
- Well-orders realized by C.E. equivalence relations (Q2104248) (← links)
- Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
- Special classes of positive preorders (Q2145061) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
- Index sets for classes of positive preorders (Q2165608) (← 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)
- Weakly precomplete equivalence relations in the Ershov hierarchy (Q2300735) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- Boolean algebras realized by c.e. equivalence relations (Q2403654) (← links)
- On universal positive graphs (Q2687461) (← links)
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS (Q5027663) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- Fixpoints and relative precompleteness (Q5075519) (← links)
- INITIAL SEGMENTS OF THE DEGREES OF CEERS (Q5100062) (← links)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- Numberings, c.e. oracles, and fixed points (Q6062177) (← links)
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
- Word problems and ceers (Q6096328) (← links)
- Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
- Computable reducibility for computable linear orders of type \(\omega \) (Q6187991) (← links)