The computable embedding problem

DOI10.1007/s10469-012-9160-2zbMath1334.03037OpenAlexW1972560533MaRDI QIDQ695798

C. Safranski, S. Quinn, J. Wallbaum, Jacob Carson, Valentina S. Harizanov, Julia F. Knight, Ekaterina B. Fokina

Publication date: 17 December 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-012-9160-2

zbMATH Keywords

computable structurecomputable embedding problemcomputable isomorphism problem

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (3)

The embedding problem for computable projective planes ⋮ Isomorphism relations on computable structures ⋮ Complexity of the isomorphism problem for computable free projective planes of finite rank

Cites Work

• Unnamed Item
• Unnamed Item
• The isomorphism problem for classes of computable fields
• Pairs of recursive structures
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Effective categoricity of equivalence structures
• A Borel reductibility theory for classes of countable structures
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Model Theory
• Turing computable embeddings
• Comparing Classes of Finite Structures
• Elementary Properties of Free Groups
• Embedding Theorems for Groups

This page was built for publication: The computable embedding problem