Publication:3712325
From MaRDI portal
zbMath0586.03032MaRDI QIDQ3712325
Publication date: 1985
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03D25: Recursively (computably) enumerable sets and degrees
Related Items
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Splitting theorems in recursion theory, A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree