INITIAL SEGMENTS OF THE DEGREES OF CEERS

DOI10.1017/jsl.2022.14OpenAlexW4212874715MaRDI QIDQ5100062

Andrea Sorbi, Uri Andrews

Publication date: 29 August 2022

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

Full work available at URL: https://doi.org/10.1017/jsl.2022.14

zbMATH Keywords

distributive latticeinitial segmentcomputably enumerable equivalence relationceer

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Classifying word problems of finitely generated algebras via computable reducibility

Cites Work

• Reducibilities among equivalence relations induced by recursively enumerable structures
• Two theorems on many-one degrees of recursively enumerable sets
• A journey to computably enumerable structures (tutorial lectures)
• The theory of ceers computes true arithmetic
• Graphs realised by r.e. equivalence relations
• Initial segments of one-one degrees
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Survey on Universal Computably Enumerable Equivalence Relations
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• Classifying positive equivalence relations
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• Joins and meets in the structure of ceers
• Computably enumerable equivalence relations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: INITIAL SEGMENTS OF THE DEGREES OF CEERS