The structure of computably enumerable preorder relations

DOI10.1007/S10469-020-09592-XMaRDI QIDQ2213931zbMATH OpenOpenAlexFDO

Authors Serikzhan A. Badaev, B. S. Kalmurzayev, 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) Theory of numerations, effectively presented structures (03D45) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• The theory of ceers computes true arithmetic
• The first-order theory of the computably enumerable equivalence relations in the uncountable setting
• Initial segments of the degrees of ceers
• A semilattice generated by superlow computably enumerable degrees
• Linear orders realized by c.e. equivalence relations
• Positive preorders
• Jumps of computably enumerable equivalence relations
• Rogers semilattices for families of equivalence relations in the Ershov hierarchy
• Joins and meets in the structure of ceers
• On the degree structure of equivalence relations under computable reducibility

Cites work

• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• A survey on universal computably enumerable equivalence relations
• Classical recursion theory. Vol. II
• Classifying positive equivalence relations
• Computably enumerable equivalence relations
• Initial segments of one-one degrees
• Joins and meets in the structure of ceers
• Jumps of computably enumerable equivalence relations
• On dark computably enumerable equivalence relations
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Positive equivalences
• The theory of ceers computes true arithmetic
• Universal computably enumerable equivalence relations
• Weakly precomplete computably enumerable equivalence relations

Cited in

(8)

• Positive preorders
• Unions of rank/trace complete preorders
• A note on joins and meets for positive linear preorders
• Computable reducibility for computable linear orders of type \(\omega \)
• Index sets for classes of positive preorders
• On universal positive graphs
• Jumps of computably enumerable equivalence relations
• The theory of ceers computes true arithmetic

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

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