scientific article; zbMATH DE number 1420832
From MaRDI portal
Publication:4944900
zbMath0951.03034MaRDI QIDQ4944900
Andrea Sorbi, Marat M. Arslanov
Publication date: 3 July 2000
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 (4)
Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ The limitations of cupping in the local structure of the enumeration degrees ⋮ A non-splitting theorem in the enumeration degrees
This page was built for publication: