scientific article; zbMATH DE number 841089
From MaRDI portal
zbMath0849.03032MaRDI QIDQ4863245
Publication date: 4 February 1996
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)
Related Items
Turing computability: structural theory, A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees