Index sets and degrees of unsolvability

DOI10.2307/2273139zbMATH Open0532.03019OpenAlexW2090505712MaRDI QIDQ3313852FDOQ3313852

Authors: Michael Stob 

Publication date: 1982

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273139

Recommendations

• scientific article; zbMATH DE number 3995654
• scientific article; zbMATH DE number 4057497
• scientific article; zbMATH DE number 3857081
• \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees
• Index sets in the arithmetical hierarchy

zbMATH Keywords

index setsdegrees of unsolvabilitysimple setspriority argument

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Title not available (Why is that?)

Cited In (2)

• Splitting theorems in recursion theory
• Index sets related to prompt simplicity

This page was built for publication: Index sets and degrees of unsolvability

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