Hyperhypersimple sets and \(\Delta _ 2\) systems

DOI10.1016/0168-0072(89)90043-2zbMath0682.03030OpenAlexW2003233489MaRDI QIDQ1823933

Yanyan Li

Publication date: 1989

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(89)90043-2

zbMATH Keywords

reverse mathematicshyperhypersimple sets\(\Delta _ 2\) system\(\Sigma _ 2\) collection\(\Sigma _ 2\) induction

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

The degree of a \(\Sigma_ n\) cut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Maximal sets in \(\alpha\)-recursion theory
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Independence Results on the Global Structure of the Turing Degrees
• Σ₂-collection and the infinite injury priority method
• Maximal sets and fragments of Peano arithmetic
• Finite injury and Σ₁-induction
• Hyperhypersimple α-r.e. sets
• Recursively enumerable sets and degrees
• On the Lattice of Recursively Enumerable Sets
• Recursively enumerable sets of positive integers and their decision problems