scientific article; zbMATH DE number 1531929
From MaRDI portal
Publication:4513972
Recommendations
- Extensions of Embeddings in the Computably Enumerable Degrees
- Extension of embeddings in the computably enumerable degrees
- Extensions of embeddings below computably enumerable degrees
- scientific article; zbMATH DE number 841089
- scientific article; zbMATH DE number 3939344
- Embedding finite lattices into the computably enumerable degrees -- a status survey
- Embedding of countable orders in Turing degrees
- Embeddings of computable structures
- Embedding finite lattices into the ideals of computably enumerable turing degrees
- Lattice embeddings into the recursively enumerable degrees
Cited in
(12)- A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
- Homomorphisms and quotients of degree structures
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
- Fragments of the theory of the enumeration degrees
- sQ₁-degrees of computably enumerable sets
- Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees
- Embeddings into the Turing degrees
- scientific article; zbMATH DE number 3939344 (Why is no real title available?)
- Algebraic aspects of the computably enumerable degrees.
- Embedding finite lattices into the ideals of computably enumerable turing degrees
- Embedding finite lattices into the Σ20 enumeration degrees
- Embedding finite lattices into the computably enumerable degrees -- a status survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513972)
