scientific article; zbMATH DE number 3873308

MaRDI QIDQ3340843zbMATH OpenFDO

Authors Kenneth W. Regan

Publication date 1984

zbMATH Keywords

arithmetical hierarchycomplexity classesdiagonalizationindex setsNPPprovabilityrecursive refutability

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Index sets and presentations of complexity classes
• scientific article; zbMATH DE number 4012593
• scientific article; zbMATH DE number 3877163
• scientific article; zbMATH DE number 3896918
• Determining the levels of some special complexity classes of sets in the Kleene arithmetical hierarchy

Cited in

(6)

• Determining the levels of some special complexity classes of sets in the Kleene arithmetical hierarchy
• Index sets and presentations of complexity classes
• scientific article; zbMATH DE number 3877163 (Why is no real title available?)
• scientific article; zbMATH DE number 3896918 (Why is no real title available?)
• scientific article; zbMATH DE number 4012593 (Why is no real title available?)
• scientific article; zbMATH DE number 1285799 (Why is no real title available?)

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 Q3340843)