Weakly precomplete equivalence relations in the Ershov hierarchy

DOI10.1007/S10469-019-09538-YzbMATH Open1485.03170OpenAlexW2987492667MaRDI QIDQ2300735FDOQ2300735

Authors: B. S. Kalmurzayev, Nikolay Bazhenov 

Publication date: 28 February 2020

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

Full work available at URL: https://doi.org/10.1007/s10469-019-09538-y

Recommendations

• Weakly precomplete computably enumerable equivalence relations
• On the degree structure of equivalence relations under computable reducibility
• Classifying equivalence relations in the Ershov hierarchy
• \(\Sigma^ n_ 0\)-equivalence relations
• The hierarchy of equivalence relations on the natural numbers under computable reducibility

zbMATH Keywords

equivalence relationErshov hierarchycomputable reducibilityweakly precomplete equivalence relationuniversal equivalence relation

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Cites Work

• Title not available (Why is that?)
• Computable structures and the hyperarithmetical hierarchy
• A Note on Positive Equivalence Relations
• Title not available (Why is that?)
• On a hierarchy of sets. III
• Theorie der Numerierungen I
• Title not available (Why is that?)
• Positive equivalences
• Classifying positive equivalence relations
• Computably enumerable equivalence relations
• Generalized computable numerations and nontrivial Rogers semilattices
• Title not available (Why is that?)
• On weakly pre-complete positive equivalences
• Computability and numberings
• Title not available (Why is that?)
• On the degree structure of equivalence relations under computable reducibility
• Title not available (Why is that?)
• Ershov hierarchy
• On dark computably enumerable equivalence relations
• Weakly precomplete computably enumerable equivalence relations
• A survey on universal computably enumerable equivalence relations
• Jumps of computably enumerable equivalence relations
• Joins and meets in the structure of ceers
• Title not available (Why is that?)
• Complexity of equivalence relations and preorders from computability theory

Cited In (12)

• Finitary reducibility on equivalence relations
• Complexity of equivalence relations and preorders from computability theory
• ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
• Computable embeddability for algebraic structures
• Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
• On dark computably enumerable equivalence relations
• The complexity of index sets of classes of computably enumerable equivalence relations
• Weakly precomplete computably enumerable equivalence relations
• The hierarchy of equivalence relations on the natural numbers under computable reducibility
• Classifying equivalence relations in the Ershov hierarchy
• Minimal equivalence relations in hyperarithmetical and analytical hierarchies
• On diagonal functions for equivalence relations

This page was built for publication: Weakly precomplete equivalence relations in the Ershov hierarchy

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