scientific article; zbMATH DE number 3784869

MaRDI QIDQ3962991zbMATH OpenFDO

Authors Stephen G. Simpson

Publication date 1980

zbMATH Keywords

constructible setshyperarithmetical hierarchynatural chains of Turing degrees obtained by iteration of the jump operator

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Cited in

(2)

• Degrees of unsolvability: a tutorial
• Mass problems associated with effectively closed sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962991)