Hyperhypersimple sets and _ 2 systems
A reverse-mathematics approach to hyperhypersimple sets - starting from the axioms of Peano arithmetic with the induction schema omitted, how much axiomatic strength need be added to obtain basic results on hyperhypersimplicity? The author shows that \(\Sigma_ 2\) induction is sufficient, but not necessary, to ensure the equivalence of (Yates' simplification of) Post's original definition of hyperhypersimplicity with Lachlan's lattice-theoretic characterization. The paper's main result, obtained using the notion of a \(\Delta_ 2\) system, is that \(\Sigma_ 2\) collection suffices to prove the existence of hyperhypersimple sets.
- Σ2-collection and the infinite injury priority method
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Finite injury and Σ1-induction
- scientific article; zbMATH DE number 3882428 (Why is no real title available?)
- scientific article; zbMATH DE number 4150148 (Why is no real title available?)
- scientific article; zbMATH DE number 4106825 (Why is no real title available?)
- scientific article; zbMATH DE number 3689386 (Why is no real title available?)
- scientific article; zbMATH DE number 1303208 (Why is no real title available?)
- scientific article; zbMATH DE number 3348085 (Why is no real title available?)
- Hyperhypersimple α-r.e. sets
- Independence Results on the Global Structure of the Turing Degrees
- Maximal sets and fragments of Peano arithmetic
- Maximal sets in -recursion theory
- On the Lattice of Recursively Enumerable Sets
- Recursively enumerable sets and degrees
- Recursively enumerable sets of positive integers and their decision problems
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
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)