scientific article; zbMATH DE number 3784869

zbMATH Open0498.03039MaRDI QIDQ3962991FDOQ3962991

Authors: Stephen G. Simpson 

Publication date: 1980

Title of this publication is not available (Why is that?)

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (2)

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

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)