Special classes of positive preorders

DOI10.33048/SEMI.2021.18.125zbMath1496.03167OpenAlexW4205330291MaRDI QIDQ2145061

N. Mukash, Aruna A. Khamitova, S. A. Badaev, B. S. Kalmurzayev

Publication date: 17 June 2022

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2021.18.125

zbMATH Keywords

computable reducibilityceerminimal preorderpositive preorderprecompleteweakly precomplete

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (2)

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

Cites Work

• On weakly pre-complete positive equivalences
• On dark computably enumerable equivalence relations
• Boolean algebras realized by c.e. equivalence relations
• A Survey on Universal Computably Enumerable Equivalence Relations
• A Note on Positive Equivalence Relations
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• Classifying positive equivalence relations
• Universal recursion theoretic properties of r.e. preordered structures
• Joins and meets in the structure of ceers
• Computably enumerable equivalence relations

This page was built for publication: Special classes of positive preorders