scientific article
From MaRDI portal
Publication:3734391
zbMath0599.03048MaRDI QIDQ3734391
No author found.
Publication date: 1984
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
On the Lattices of Effectively Open Sets ⋮ The theory of the polynomial many-one degrees of recursive sets is undecidable ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Computably enumerable sets and related issues
