Positive equivalences
From MaRDI portal
Publication:1393225
DOI10.1007/BF02218645zbMath0276.02024OpenAlexW4230007549MaRDI 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
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (27)
On dark computably enumerable equivalence relations ⋮ NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES ⋮ Index sets for classes of positive preorders ⋮ On a conjecture of Bergstra and Tucker ⋮ The theory of ceers computes true arithmetic ⋮ ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ Jumps of computably enumerable equivalence relations ⋮ On universal positive graphs ⋮ Computable reducibility for computable linear orders of type \(\omega \) ⋮ 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 ⋮ The structure of computably enumerable preorder relations ⋮ Learnability and positive equivalence relations ⋮ Irreducible, singular, and contiguous degrees ⋮ Positive preorders ⋮ On computably enumerable structures ⋮ Maximal r.e. equivalence relations ⋮ Weakly precomplete computably enumerable equivalence relations ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ Fixed point theorems for precomplete numberings ⋮ The category of equivalence relations ⋮ \(\Sigma^ n_ 0\)-equivalence relations ⋮ Graphs realised by r.e. equivalence relations ⋮ \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets ⋮ Computable embeddability for algebraic structures
Cites Work
This page was built for publication: Positive equivalences
