Positive preorders

DOI10.1007/S10469-018-9491-8zbMath1485.03113OpenAlexW4238023494MaRDI QIDQ1757648

D. K. Kabylzhanova

Publication date: 15 January 2019

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

Full work available at URL: https://doi.org/10.1007/s10469-018-9491-8

zbMATH Keywords

computable reducibilitycomputable isomorphism classescomputably enumerable equivalence

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) 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

• Reducibilities among equivalence relations induced by recursively enumerable structures
• Arithmetic hierarchy and ideals of enumerated Boolean algebras
• Positive equivalences with finite classes and related algebras
• Positive equivalences
• Weakly precomplete computably enumerable equivalence relations
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• Analytic equivalence relations and bi-embeddability
• Equivalence Relations on Classes of Computable Structures
• Computably enumerable equivalence relations

This page was built for publication: Positive preorders