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

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.