Computably enumerable equivalence relations

DOI10.1023/A:1010521410739zbMath0981.03046arXiv1012.0944OpenAlexW1909320839MaRDI QIDQ5939996

Su Gao, Peter M. Gerdes

Publication date: 23 July 2001

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.0944

zbMATH Keywords

reducibilitycomputably enumerable equivalence relations

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (36)

Completeness of the hyperarithmetic isomorphism equivalence relation ⋮ Special classes of positive preorders ⋮ On dark computably enumerable equivalence relations ⋮ Primitive recursive equivalence relations and their primitive recursive complexity ⋮ LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS ⋮ Index sets for classes of positive preorders ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ INITIAL SEGMENTS OF THE DEGREES OF CEERS ⋮ The theory of ceers computes true arithmetic ⋮ Agreement reducibility ⋮ ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS ⋮ Word problems and ceers ⋮ ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ Jumps of computably enumerable equivalence relations ⋮ On universal positive graphs ⋮ Computable reducibility for computable linear orders of type \(\omega \) ⋮ Classifying equivalence relations in the Ershov hierarchy ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ Minimal equivalence relations in hyperarithmetical and analytical hierarchies ⋮ \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures ⋮ FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS ⋮ THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ The structure of computably enumerable preorder relations ⋮ Elementary theories and hereditary undecidability for semilattices of numberings ⋮ Positive preorders ⋮ On computably enumerable structures ⋮ Weakly precomplete computably enumerable equivalence relations ⋮ On the degree structure of equivalence relations under computable reducibility ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ On Σ¹ ₁ equivalence relations over the natural numbers ⋮ Graphs realised by r.e. equivalence relations ⋮ Computable embeddability for algebraic structures ⋮ Subrecursive equivalence relations and (non-)closure under lattice operations

This page was built for publication: Computably enumerable equivalence relations