Minimal equivalence relations in hyperarithmetical and analytical hierarchies

DOI10.1134/S199508022002002XzbMath1469.03116arXiv1909.12247OpenAlexW3043792391MaRDI QIDQ2207013

M. M. Yamaleev, Luca San Mauro, Manat Mustafa, Nikolay Bazhenov

Publication date: 27 October 2020

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.12247

zbMATH Keywords

minimal degreeanalytical hierarchyequivalence relationhyperarithmetical hierarchycomputable reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS ⋮ Computable embeddability for algebraic structures

Cites Work

• Unnamed Item
• Unnamed Item
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Positive equivalences
• Jumps of computably enumerable equivalence relations
• Classifying equivalence relations in the Ershov hierarchy
• On the degree structure of equivalence relations under computable reducibility
• Weakly precomplete equivalence relations in the Ershov hierarchy
• Computable isomorphisms of distributive lattices
• Equivalence Relations That Are $\Sigma^0_3$ Complete for Computable Reducibility
• COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
• A Survey on Universal Computably Enumerable Equivalence Relations
• Classifying positive equivalence relations
• Joins and meets in the structure of ceers
• Isomorphism relations on computable structures
• Computably enumerable equivalence relations

This page was built for publication: Minimal equivalence relations in hyperarithmetical and analytical hierarchies