scientific article
From MaRDI portal
Publication:3815291
zbMath0664.03032MaRDI QIDQ3815291
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
strong constructibilityclassification of algebraic systems by Turing degrees of unsolvabilitydegree of constructibilitym-degrees of recursively enumerable setsconstructible structure
Undecidability and degrees of sets of sentences (03D35) Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Related Items (3)
Arithmetic hierarchy and ideals of enumerated Boolean algebras ⋮ Algorithmic dimension of lattices ⋮ Precomplete numberings
This page was built for publication: