Computably enumerable equivalence relations
From MaRDI portal
Publication:5939996
DOI10.1023/A:1010521410739zbMath0981.03046arXiv1012.0944MaRDI QIDQ5939996
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
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Primitive recursive equivalence relations and their primitive recursive complexity, INITIAL SEGMENTS OF THE DEGREES OF CEERS, ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, Computable embeddability for algebraic structures, Agreement reducibility, ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS, Word problems and ceers, COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR, Classifying word problems of finitely generated algebras via computable reducibility, Computable reducibility for computable linear orders of type \(\omega \), \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures, Reducibilities among equivalence relations induced by recursively enumerable structures, On dark computably enumerable equivalence relations, Jumps of computably enumerable equivalence relations, Elementary theories and hereditary undecidability for semilattices of numberings, Positive preorders, Subrecursive equivalence relations and (non-)closure under lattice operations, Completeness of the hyperarithmetic isomorphism equivalence relation, Special classes of positive preorders, Index sets for classes of positive preorders, The theory of ceers computes true arithmetic, Classifying equivalence relations in the Ershov hierarchy, Minimal equivalence relations in hyperarithmetical and analytical hierarchies, The structure of computably enumerable preorder relations, On computably enumerable structures, On the degree structure of equivalence relations under computable reducibility, Weakly precomplete equivalence relations in the Ershov hierarchy, Graphs realised by r.e. equivalence relations, Boolean algebras realized by c.e. equivalence relations, On universal positive graphs, Weakly precomplete computably enumerable equivalence relations, A Survey on Universal Computably Enumerable Equivalence Relations, FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS, THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, On Σ1 1 equivalence relations over the natural numbers, LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
