The computable embedding problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2047478 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Borel reductibility theory for classes of countable structures
- Comparing Classes of Finite Structures
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Effective categoricity of equivalence structures
- Elementary Properties of Free Groups
- Embedding Theorems for Groups
- Model Theory
- Pairs of recursive structures
- The isomorphism problem for classes of computable fields
- The isomorphism problem for computable Abelian p-groups of bounded length
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Turing computable embeddings
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)