scientific article
From MaRDI portal
Publication:4044555
zbMath0293.02028MaRDI QIDQ4044555
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (11)
Structural interactions of the recursively enumerable T- and W-degrees ⋮ The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Computational processes, observers and Turing incompleteness ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element ⋮ Recursively enumerable sets and degrees ⋮ A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees ⋮ Computably enumerable sets and quasi-reducibility ⋮ Automorphisms of the lattice of recursively enumerable sets ⋮ The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
This page was built for publication:
