The structure of computably enumerable preorder relations

DOI10.1007/s10469-020-09592-xzbMath1462.03018OpenAlexW3097762558MaRDI QIDQ2213931

B. S. Kalmurzayev, S. A. Badaev, Nikolay Bazhenov

Publication date: 4 December 2020

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

Full work available at URL: https://doi.org/10.1007/s10469-020-09592-x

zbMATH Keywords

computable reducibilitycomputably enumerable preorderstructure induced by degrees of computably enumerable preorder relations with respect to computable 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 (3)

Index sets for classes of positive preorders ⋮ On universal positive graphs ⋮ Computable reducibility for computable linear orders of type \(\omega \)

Cites Work

• Unnamed Item
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Classical recursion theory. Vol. II
• Positive equivalences
• On dark computably enumerable equivalence relations
• Jumps of computably enumerable equivalence relations
• The theory of ceers computes true arithmetic
• Initial segments of one-one degrees
• Weakly precomplete computably enumerable equivalence relations
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Survey on Universal Computably Enumerable Equivalence Relations
• Classifying positive equivalence relations
• Joins and meets in the structure of ceers
• Computably enumerable equivalence relations

This page was built for publication: The structure of computably enumerable preorder relations