Computable embeddability for algebraic structures

DOI10.1142/S1793557122501261MaRDI QIDQ5876742zbMATH OpenOpenAlexFDO

Authors Nikolay Bazhenov, Mustafa Manat

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

computable reducibilitycomputable structure theorydistributive latticeisomorphic embeddingpreorderprimitive recursionpunctual structuretorsion abelian group

Mathematics Subject Classification ID

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

Cites work

• A Borel reductibility theory for classes of countable structures
• A structure of punctual dimension two
• A survey on universal computably enumerable equivalence relations
• Algebraic structures computable without delay
• Algorithmic complexity of algebraic systems
• Arithmetic hierarchy of Abelian groups
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Borel equivalence relations
• Classifying equivalence relations in the Ershov hierarchy
• Classifying positive equivalence relations
• Complete analytic equivalence relations
• Complexity of equivalence relations and preorders from computability theory
• Computable abelian groups
• Computable bi-embeddable categoricity
• Computable isomorphisms of distributive lattices
• Computable structures and the hyperarithmetical hierarchy
• Computably enumerable equivalence relations
• Degrees of bi-embeddable categoricity
• Degrees of bi-embeddable categoricity of equivalence structures
• Eliminating unbounded search in computable algebra
• Equivalence relations that are ^0_3 complete for computable reducibility (extended abstract)
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Foundations of online structure theory. II: The operator approach
• scientific article; zbMATH DE number 4148067 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• scientific article; zbMATH DE number 1303204 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• Invariant descriptive set theory
• Isomorphism relations on computable structures
• Joins and meets in the structure of ceers
• JSL volume 79 issue 2 Cover and Back matter
• Minimal equivalence relations in hyperarithmetical and analytical hierarchies
• On the degree structure of equivalence relations under computable reducibility
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Polynomial computability of fields of algebraic numbers
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models
• Positive equivalences
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Recent developments in the theory of Borel reducibility
• Space complexity of abelian groups
• The back-and-forth method and computability without delay
• The bi-embeddability relation for countable abelian groups
• The theory of ceers computes true arithmetic
• Theorie der Numerierungen I
• Uncountable structures are not classifiable up to bi-embeddability
• Universal computably enumerable equivalence relations
• Weakly precomplete computably enumerable equivalence relations
• Weakly precomplete equivalence relations in the Ershov hierarchy

Cited in

(4)

• Computing coproducts of finitely presented Gödel algebras
• Homomorphism and embedding universal structures for restricted classes
• Some new computable structures of high rank
• Computable categoricity for algebraic fields with splitting algorithms

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

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