On computably enumerable structures

DOI10.1134/S1995080214040180zbMath1325.03035OpenAlexW2009499327MaRDI QIDQ2263114

Yanyan Li

Publication date: 17 March 2015

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080214040180

zbMATH Keywords

universal algebrascomputable structurescomputably enumerable structures

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite time decidable equivalence relation theory
• The effective theory of Borel equivalence relations
• Reducibilities among equivalence relations induced by recursively enumerable structures
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Classical recursion theory. The theory of functions and sets of natural numbers
• Initial segments of recursive linear orders
• Computable isomorphisms, degree spectra of relations, and Scott families
• Positive equivalences
• Graphs realised by r.e. equivalence relations
• A Note on Positive Equivalence Relations
• On Σ¹ ₁ equivalence relations over the natural numbers
• Classifying positive equivalence relations
• Rekursive Algebren mit Kettenbedingungen
• COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
• Isomorphism relations on computable structures
• Two notes on subshifts
• Finitely presented expansions of groups, semigroups, and algebras
• Semirecursive Sets and Positive Reducibility
• Computably enumerable equivalence relations

This page was built for publication: On computably enumerable structures