Abstract closure scheme for ascent operators
Construct an abstract class of admissible ascent operators, including temporal semantic elevation and hierarchical supervisory ascent, under which the class of non-verifiable properties \(\mathcal{U}\) is closed, thereby establishing a single closure principle encompassing the article’s one-step, iterated, and supervisory results.
References
There is an abstract class of ``admissible ascent operators''---including temporal elevation and hierarchical supervision---under which $\mathcal{U}$ is closed. The closure theorem of this article and the non-termination of the supervisory tower would be two instances of one principle: every admissible ascent preserves non-verifiability.
The conjecture is that $$ forces the non-factorisation through $2$ of its values in $\mathcal{U}$, by an application of Lawvere's theorem to a fixed-point-free endomorphism of $\Omega$, with the point-surjection built from the universal enumeration of PC.