scientific article; zbMATH DE number 5175706
From MaRDI portal
Publication:5295698
zbMath1123.03037MaRDI QIDQ5295698
Publication date: 30 July 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25)
Related Items
Effectively closed sets and enumerations ⋮ The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
This page was built for publication: