Hypergendered Logic Source
Hypergendered Logic — Page 216
242. Quality-Magnitude Well-Ordering, Limit-State Closure, and Limit-Supremum
axioms
Three typed rules are required before ordinary omega and later limit-stage consequences are fully derivable:
a quality-magnitude ordering, an ontological constructor for the limit state itself, and a quality-supremum rule
over that constructed state.
Quality-Magnitude Well-Ordering Axiom (QMWA): whole-form quality magnitudes occupy the ordered
magnitude scale m0<m1<m2<...<aleph_0<aleph_1<..., with optional within-magnitude refinement delta. A
Significant Quality Increase moves to a strictly higher magnitude mu; an ordinary improvement may remain
inside one mu.
Limit-State Closure Constructor (LSCC): for every canonical nonzero limit ordinal lambda inside a minor
hypercategory, construct a first-class female limit state LimF(lambda) and male limit state LimM(lambda),
written SF^lambda and SM^lambda. The constructor stores two source domains rather than a literal infinitary
Boolean string: OwnPred_F(lambda)={SF^beta:1<=beta<lambda} and OppPred_F(lambda)={NOT
SM^beta:1<=beta<lambda}, with the exact male mirror.
For every beta<lambda, SF^lambda has target-relative IH(SF^beta), IH(NOT SM^beta), PH(SF^beta), NOT
PH(SM^beta), UD(SF^beta), and NOT FD(SF^beta). SM^lambda has the exact mirror. These closure
clauses can be written meta-mathematically as an infinitary conjunction, but the core HGL object language
does not need infinitary Boolean syntax; LimF/LimM remain typed set-indexed constructors whose
consequences are generated by membership rules.
Limit closure is provenance-preserving: the fact that SF^lambda entails SF^beta does not flatten the source
to an unindexed generic ancestor. beta remains part of the IH/PH/UD source identity. A limit can therefore
contain an unbounded ancestry while remaining machine-representable through an ordinal-bounded
predecessor-set descriptor.
Successor-after-limit rule: once SF^lambda/SM^lambda has been constructed,
SF^(lambda+1)/SM^(lambda+1) is generated by the ordinary six-conjunct successor schema with
alpha=lambda. Thus the same typed successor rule operates after finite and limit stages; only limit
construction itself uses LSCC.
Limit Quality Supremum Axiom (LQSA): if LSCC has constructed the canonical limit state
SF^lambda/SM^lambda, its whole-form quality is at least the supremum of the whole-form qualities attained
at all prior substages below lambda.
Limit(lambda) => Q(SF^lambda) >= sup_{beta<lambda} Q(SF^beta)
Limit(lambda) => Q(SM^lambda) >= sup_{beta<lambda} Q(SM^beta)
QMWA, LSCC, and LQSA are HGL axioms/constructors, not theorems of ordinal notation alone. LSCC
repairs the former ontological gap: the theory no longer assigns a quality to an undefined
SF^lambda/SM^lambda name. LQSA then prevents an omega-long or transfinite chain of genuine stage
improvements from collapsing at a constructed limit into a lower-quality state.
243. Ordinary omega theorem: why SF^omega and SM^omega are at least
aleph-null in quality
Type the omega carefully. Here omega is omega_sub: the ordinary first infinite local-substage limit inside one
minor hypercategory. It is not the HGL Hyperomega boundary Omega_H, and it is not omega_cat, the limit of
the minor-category index.
Assume the progression begins at a finite quality magnitude or any higher starting point. SUQB makes every
finite successor a Significant Quality Increase. QMWA makes these magnitude ranks strictly ascend. LSCC
constructs SF^omega and SM^omega as first-class limit states carrying the full predecessor closure. LQSA
then places each constructed omega-limit at or above the supremum of all finite magnitude ranks. The
minimum transfinite result is aleph_0.
Source Canon: Verbatim mathematical and modal logic. Interactive navigation and operator lookups available at /#hgl-part:216.