Hyperhypersimple sets and _ 2 systems
DOI10.1016/0168-0072(89)90043-2zbMATH Open0682.03030OpenAlexW2003233489MaRDI QIDQ1823933FDOQ1823933
Authors: 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
Recommendations
reverse mathematicshyperhypersimple sets\(\Delta _ 2\) system\(\Sigma _ 2\) collection\(\Sigma _ 2\) induction
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Title not available (Why is that?)
- Σ2-collection and the infinite injury priority method
- Finite injury and Σ1-induction
- Recursively enumerable sets and degrees
- Recursively enumerable sets of positive integers and their decision problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Independence Results on the Global Structure of the Turing Degrees
- On the Lattice of Recursively Enumerable Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximal sets in \(\alpha\)-recursion theory
- Hyperhypersimple α-r.e. sets
- Title not available (Why is that?)
- Maximal sets and fragments of Peano arithmetic
Cited In (2)
This page was built for publication: Hyperhypersimple sets and \(\Delta _ 2\) systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823933)
