On diagonal functions for equivalence relations

DOI10.1007/S00153-023-00896-0MaRDI QIDQ6128777zbMATH OpenOpenAlexFDO

Authors Serikzhan A. Badaev, Nikolay Bazhenov, B. S. Kalmurzayev, Mustafa Manat

Publication date 16 April 2024

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-023-00896-0

zbMATH Keywords

computably enumerable equivalence relationdiagonal functionDNC degreeErshov hierarchyweakly precomplete equivalence

Mathematics Subject Classification ID

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

Recommendations

• Weakly precomplete equivalence relations in the Ershov hierarchy
• Weakly precomplete computably enumerable equivalence relations
• Complexity of equivalence relations and preorders from computability theory
• On Some Properties of Recursively Enumerable Equivalence Relations
• On weakly pre-complete positive equivalences

This page was built for publication: On diagonal functions for equivalence relations

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