scientific article; zbMATH DE number 3548956
From MaRDI portal
Publication:4123306
zbMath0353.02019MaRDI QIDQ4123306
Publication date: 1976
Full work available at URL: https://eudml.org/doc/70881
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (3)
On some filters and ideals of the Medvedev lattice ⋮ The finite intervals of the Muchnik lattice ⋮ Comparing the degrees of enumerability and the closed Medvedev degrees
This page was built for publication:
