scientific article; zbMATH DE number 3458600
From MaRDI portal
Publication:4044555
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Cited in
(11)- Structural interactions of the recursively enumerable T- and W-degrees
- A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
- Computably enumerable sets and quasi-reducibility
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- Recursively enumerable sets and degrees
- Automorphisms of the lattice of recursively enumerable sets
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
- Computational processes, observers and Turing incompleteness
- The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
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 Q4044555)
