scientific article; zbMATH DE number 3532932
From MaRDI portal
Publication:4109659
zbMath0342.02027MaRDI QIDQ4109659
Publication date: 1975
Full work available at URL: https://eudml.org/doc/186882
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)
Related Items
PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES ⋮ Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I ⋮ Families of general recursive functions with a finite number of limit points ⋮ The enumeration degrees: Local and global structural interactions ⋮ Supplement to Yu. L. Ershov's article The upper semilattice of numerations of a finite set ⋮ Empty intervals in the enumeration degrees ⋮ The upper semilattice of numerations ⋮ Strong reducibilities
This page was built for publication:
