COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR

DOI10.1017/jsl.2022.45arXiv2005.13777OpenAlexW3028826428WikidataQ114117975 ScholiaQ114117975MaRDI QIDQ6103452

John D. Clemens, Samuel Coskey, Unnamed Author

Publication date: 5 June 2023

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

hyperarithmetic equivalence relationscomputable reducibilityceers

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Recursive ordinals and ordinal notations (03F15) Higher-type and set recursion theory (03D65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical recursion theory. Vol. II
• Jumps of computably enumerable equivalence relations
• Turing Computability
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Borel reductibility theory for classes of countable structures
• Classifying positive equivalence relations
• Equivalence Relations on Classes of Computable Structures
• The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
• Uniform Martin’s conjecture, locally
• Joins and meets in the structure of ceers
• Isomorphism relations on computable structures
• Computably enumerable equivalence relations

This page was built for publication: COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR