scientific article

zbMath0586.03032MaRDI QIDQ3712325

Manuel Lerman

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyupper-semilattice of recursively enumerable degreesnonembeddable lattices

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (4)

A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Splitting theorems in recursion theory

This page was built for publication: