Positive equivalences

DOI10.1007/BF02218645MaRDI QIDQ1393225zbMATH OpenOpenAlexFDO

Authors Yuri L. Ershov

Publication date 1973

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02218645

Mathematics Subject Classification ID

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

Cites work

• A Theorem on Recursively Enumerable Classes and Splinters
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Initial Segments of Many-One Degrees
• Recursively enumerable many-one degrees
• Relationships Between Reducibilities

Cited in

(30)

• 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
• 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
• \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
• A note on joins and meets for positive linear preorders
• Irreducible, singular, and contiguous degrees
• Computably enumerable equivalence relations via primitive recursive reductions
• On the theory of computably enumerable linear preorders with concatenation
• \(\Sigma^ n_ 0\)-equivalence relations
• Reducibilities among equivalence relations induced by recursively enumerable structures

This page was built for publication: Positive equivalences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393225)