Hyperarithmetical Index Sets in Recursion Theory

DOI10.2307/2000684MaRDI QIDQ3797173zbMATH OpenOpenAlexFDO

Authors Steffen Lempp

Publication date 1987

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

zbMATH Keywords

coinfinite r.e. setshyperarithmetical hierarchyhyperhypersimple setsindex setsquasimaximal sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Index sets in the arithmetical hierarchy
• Index sets in the hyperarithmetical hierarchy
• Index sets of classes of hyper-hypersimple sets
• Fine hierarchy and definable index sets
• scientific article; zbMATH DE number 6318

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3652325 (Why is no real title available?)
• On the Lattice of Recursively Enumerable Sets
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(24)

• Index sets in the hyperarithmetical hierarchy
• Index sets in the arithmetical hierarchy
• Index sets related to prompt simplicity
• Index sets of classes of hyper-hypersimple sets
• Index sets in computable analysis
• Index sets for ^0_1 classes
• Classification of the index sets of low \([n]^ p\) and high \([n]^ p\)
• Coding in the partial order of enumerable sets
• Effectively closed sets and graphs of computable real functions.
• A representation of recursively enumerable sets through Horn formulas in higher recursion theory
• Discrete families of recursive functions and index sets
• \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees
• \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
• A lightface analysis of the differentiability rank
• Rice's theorem in effectively enumerable topological spaces
• Hyperarithmetical Sets
• scientific article; zbMATH DE number 3851066 (Why is no real title available?)
• scientific article; zbMATH DE number 749926 (Why is no real title available?)
• Ranked structures and arithmetic transfinite recursion
• Intrinsically Hyperarithmetical Sets
• An effective analysis of the Denjoy rank
• Effectively closed sets and enumerations
• Fine hierarchies and m-reducibilities in theoretical computer science

This page was built for publication: Hyperarithmetical Index Sets in Recursion Theory

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