Boolean algebras realized by c.e. equivalence relations

DOI10.17377/SEMI.2017.14.071zbMath1423.03147OpenAlexW2769174550MaRDI QIDQ2403654

Frank Stephan, M. M. Yamaleev, Nikolay Bazhenov, Manat Mustafa

Publication date: 11 September 2017

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

Full work available at URL: https://dspace.kpfu.ru/xmlui/bitstream/net/117110/1/F_p848_855.pdf

zbMATH Keywords

equivalence relationsBoolean algebrascomputability theorycomputably enumerable structures

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Special classes of positive preorders ⋮ Well-orders realized by C.E. equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• On weakly pre-complete positive equivalences
• Reducibilities among equivalence relations induced by recursively enumerable structures
• Arithmetic hierarchy and ideals of enumerated Boolean algebras
• Graphs realised by r.e. equivalence relations
• Weakly precomplete computably enumerable equivalence relations
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Survey on Universal Computably Enumerable Equivalence Relations
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• Rekursive Algebren mit Kettenbedingungen
• Hierarchies of Boolean algebras
• Computably enumerable equivalence relations

This page was built for publication: Boolean algebras realized by c.e. equivalence relations