Positive equivalences
From MaRDI portal
Publication:1393225
DOI10.1007/BF02218645zbMath0276.02024MaRDI QIDQ1393225
Publication date: 1973
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02218645
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES, ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, Maximal r.e. equivalence relations, Computable embeddability for algebraic structures, Computable reducibility for computable linear orders of type \(\omega \), \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures, Irreducible, singular, and contiguous degrees, \(\Sigma^ n_ 0\)-equivalence relations, Reducibilities among equivalence relations induced by recursively enumerable structures, On a conjecture of Bergstra and Tucker, On dark computably enumerable equivalence relations, Jumps of computably enumerable equivalence relations, Positive preorders, The category of equivalence relations, Index sets for classes of positive preorders, The theory of ceers computes true arithmetic, Minimal equivalence relations in hyperarithmetical and analytical hierarchies, The structure of computably enumerable preorder relations, Learnability and positive equivalence relations, On computably enumerable structures, Weakly precomplete equivalence relations in the Ershov hierarchy, Fixed point theorems for precomplete numberings, Graphs realised by r.e. equivalence relations, \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets, On universal positive graphs, Weakly precomplete computably enumerable equivalence relations, A Survey on Universal Computably Enumerable Equivalence Relations
Cites Work
