The computable embedding problem
From MaRDI portal
Publication:695798
DOI10.1007/S10469-012-9160-2zbMATH Open1334.03037OpenAlexW1972560533MaRDI QIDQ695798FDOQ695798
Authors: S. Quinn, C. Safranski, John Wallbaum, J. Carson, E. B. Fokina, Valentina Harizanov, J. F. Knight 
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
Recommendations
Cites Work
- Model Theory
- Title not available (Why is that?)
- Computable structures and the hyperarithmetical hierarchy
- A Borel reductibility theory for classes of countable structures
- The isomorphism problem for computable Abelian p-groups of bounded length
- Title not available (Why is that?)
- Turing computable embeddings
- Comparing Classes of Finite Structures
- Embedding Theorems for Groups
- Effective categoricity of equivalence structures
- Pairs of recursive structures
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Degree spectra and computable dimensions in algebraic structures
- Elementary Properties of Free Groups
- The isomorphism problem for classes of computable fields
Cited In (6)
- Embeddings of computable structures
- Isomorphism relations on computable structures
- Complexity of the isomorphism problem for computable free projective planes of finite rank
- Effective embeddings for pairs of structures
- The embedding problem for computable projective planes
- The parameterized space complexity of embedding along a path
This page was built for publication: The computable embedding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695798)
