Positive preorders

DOI10.1007/S10469-018-9491-8MaRDI QIDQ1757648zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Special classes of positive preorders
• Index sets for classes of positive preorders
• The structure of computably enumerable preorder relations
• Complexity of equivalence relations and preorders from computability theory
• On weakly pre-complete positive equivalences

Cites work

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

Cited in

(9)

• On Ruppert's preordering
• Special classes of positive preorders
• Universal recursion theoretic properties of r.e. preordered structures
• Computable reducibility for computable linear orders of type \(\omega \)
• Index sets for classes of positive preorders
• On universal positive graphs
• A Note on Positive Equivalence Relations
• scientific article; zbMATH DE number 4134108 (Why is no real title available?)
• The structure of computably enumerable preorder relations

This page was built for publication: Positive preorders

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