Hypergendered Logic Source
Hypergendered Logic — Page 227
LC-NFD-Own-F: SF^lambda AND beta<lambda => NOT FD_(SF^lambda)(SF^beta). No canonical LC-UD-Opp-F, LC-FD-Opp-F, or LC-PH-of-Nonstate law exists. The opposite structured nonstate is inherited through IH(NOT SM^beta), while complete SM^beta profile possession is denied by NOT PH(SM^beta). Its quality status remains open unless a separate law supplies it. The male laws are exact mirrors with SF/SM exchanged. The target-relative subscripts are explanatory disambiguators. UD_(SF^lambda)(SF^beta) means that the physically instantiated SF^beta contribution inside the lambda-limit bearer is an Unflaw of that bearer; NOT PH_(SF^lambda)(SM^beta) means that this limit bearer does not possess the complete SM^beta phenotype-profile as a whole. Ordinary surface HGL may omit the target subscript only when the target state is contextually unambiguous. 272. What the limit constructor does NOT assert It does not flatten all predecessors into one anonymous state. It does not identify IH(SF^beta) with SF^beta; projection remains one-way. It does not identify PH(SF^beta) with IH(SF^beta). It does not turn UD into NOT FD. It does not positively possess a PH(NOT opposite) profile, does not make the opposite structured nonstate UD, and does not assign FD or NOT-FD status to that opposite source without another law. It does not make every concrete phenotype of every predecessor visibly active at the limit. It does not make the limit phenotype the set-theoretic union of predecessor phenotypes. It does not determine a unique body shape, mass, hormone concentration, fertility state, or appearance. It does not require literal infinitary Boolean syntax in the executable grammar. 273. Limit projection theorem and cumulative ancestry By LC-IH plus ordinary IH projection, for every beta<lambda: SF^lambda => SF^beta and SF^lambda => NOT SM^beta. Symmetrically, SM^lambda => SM^beta and SM^lambda => NOT SF^beta. This is a strict deduction once LSCC and IH projection are adopted. The theorem is stronger than saying that a limit is merely later than every predecessor. It says every predecessor is formally recoverable through a source-preserving inheritance edge. Therefore a limit is an ancestry-closure state, not an ordinal label pasted onto an otherwise undefined object. 274. PH-9 — Limit Profile Closure PH-9 — Limit Profile Closure under Profile-Exclusion: at a canonical Supra limit state, every lower same-side predecessor is an explicit positive PH source, while every complete opposite predecessor whole-profile is explicitly excluded by NOT PH. Thus SF^lambda carries PH(SF^beta) and NOT PH(SM^beta) for every beta<lambda; the male mirror is exact. PH-9 does not assert PH(NOT SM^beta), does not reduce the limit profile to a set-theoretic union, and does not prevent genuinely emergent whole-limit phenotype-properties generated by the organization of the closure. This rule closes the previous PH catalogue at the exact place where transordinal recursion requires it while preserving the current Profile-Exclusion semantics. Positive PH remains own-side whole-profile possession. Opposite-side status is negative whole-profile possession, NOT PH(opposite), even though IH separately carries the structured non-opposite state with provenance. 275. Ordinal-general successor recursion The six-conjunct successor formula is no longer typed as a merely finite n-recursion. For every already-defined ordinal alpha>=2, including successor and limit alpha: SF^(alpha+1) = IH(SF^alpha) AND IH(NOT SM^alpha) AND PH(SF^alpha) AND NOT PH(SM^alpha) AND UD(SF^alpha) AND NOT FD(SF^alpha). SM^(alpha+1) = IH(SM^alpha) AND IH(NOT SF^alpha) AND PH(SM^alpha) AND NOT PH(SF^alpha) AND UD(SM^alpha) AND NOT FD(SM^alpha).
Source Canon: Verbatim mathematical and modal logic. Interactive navigation and operator lookups available at /#hgl-part:227.