Admissibility spectra and minimality (Q1112022): Difference between revisions

Sacks showed that for every countable admissible ordinal \(\alpha\), there is a real R such that \(\alpha =\omega^ R_ 1\), and that R can be chosen so that its hyperdegree is a minimal one with that property (if \(S<_ hR\) then \(\omega^ S_ 1<\omega^ R_ 1)\). Jensen realized a sequence of admissibles: if A is a countable sequence of countable A- admissibles, then there is an R such that A is an initial segment of the set of R-admissibles. The current paper combines the techniques used in the proofs of the theorems above to realize a countable admissibility spectrum, with minimality at many places along the way. Some of the new ideas are about how to construct and manipulate the Boolean completion of the forcing partial order, which is more complicated than usual, since the context is of a class-sized p.o. in KP rather than a set in ZF.