On weakly pre-complete positive equivalences

DOI10.1007/BF00972779zbMath0733.03034MaRDI QIDQ810013

S. A. Badaev

Publication date: 1991

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

precomplete numerationweakly precomplete positive equivalences

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items

Special classes of positive preorders ⋮ On dark computably enumerable equivalence relations ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ Numberings, c.e. oracles, and fixed points ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ Weakly precomplete computably enumerable equivalence relations ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy

Cites Work

• Effective extendability and fixed-points
• A Note on Positive Equivalence Relations