Computable embeddability for algebraic structures

DOI10.1142/S1793557122501261OpenAlexW3207861448MaRDI QIDQ5876742

Manat Mustafa, Nikolay Bazhenov

Publication date: 2 February 2023

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557122501261

zbMATH Keywords

distributive latticeisomorphic embeddingpreorderprimitive recursioncomputable structure theorytorsion abelian groupcomputable reducibilitypunctual structure

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic structures computable without delay
• Space complexity of abelian groups
• Algorithmic complexity of algebraic systems
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Polynomial-time versus recursive models
• Polynomial-time Abelian groups
• Positive equivalences
• Computable structures and the hyperarithmetical hierarchy
• Computable bi-embeddable categoricity
• Arithmetic hierarchy of Abelian groups
• Polynomial computability of fields of algebraic numbers
• Eliminating unbounded search in computable algebra
• The theory of ceers computes true arithmetic
• Classifying equivalence relations in the Ershov hierarchy
• Minimal equivalence relations in hyperarithmetical and analytical hierarchies
• The back-and-forth method and computability without delay
• On the degree structure of equivalence relations under computable reducibility
• Weakly precomplete equivalence relations in the Ershov hierarchy
• Degrees of bi-embeddable categoricity of equivalence structures
• Computable isomorphisms of distributive lattices
• Recent developments in the theory of Borel reducibility
• Weakly precomplete computably enumerable equivalence relations
• COMPUTABLE ABELIAN GROUPS
• Equivalence Relations That Are $\Sigma^0_3$ Complete for Computable Reducibility
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
• JSL volume 79 issue 2 Cover and Back matter
• A Survey on Universal Computably Enumerable Equivalence Relations
• A Borel reductibility theory for classes of countable structures
• Borel Equivalence Relations
• Classifying positive equivalence relations
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Theorie der Numerierungen I
• The bi-embeddability relation for countable abelian groups
• Degrees of bi-embeddable categoricity
• A structure of punctual dimension two
• Uncountable structures are not classifiable up to bi-embeddability
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Joins and meets in the structure of ceers
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Complete analytic equivalence relations
• Isomorphism relations on computable structures
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Computably enumerable equivalence relations

This page was built for publication: Computable embeddability for algebraic structures