scientific article
From MaRDI portal
Publication:3665086
zbMath0517.03013MaRDI QIDQ3665086
Publication date: 1983
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 (4)
Maximal theories ⋮ 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
This page was built for publication:
