Hypergendered Logic Source
Hypergendered Logic — Page 48
• ConditionAtom(x) and ConditionAtom(y); • CondNOT, CondAND, CondOR for formulas used as inner conditions; • PA(condition); • StateNOT, StateAND, StateOR for outer state logic; • IH(source, source_id, depth) where the source sort is explicitly recorded as a condition-source or an already-defined HGL state/non-state source; • PH(source, profile_id) for irreducible whole-profile phenotype possession; • SF[n], SM[n]; • FemaleType, MaleType; • temporal stage, maturity, phenotype-expression, and developmental-history variables. The type checker should reject a core expression such as 𝑃𝐴𝑃𝐴𝑥 ( ) ( ), because the child of PA is not an inner developmental condition. It should accept condition-source inheritance such as , state-source inheritance such as 𝐼𝐻𝑥 ( ) 𝐼𝐻𝑃𝐴𝑥 ( ) ( ), and phenotype/profile-status nodes such as PH(x AND NOT y), PH(SF1), and NOT PH(SM1), while retaining source sort and the distinction between positive PH and outer profile negation. 63. Preserve five representations, not one For every important HGL expression, an AI should retain: 1. surface notation — what the author wrote; 2. Boolean projection/normal form — ordinary logical consequences after applying allowed equivalences; 3. PA causal scope — the exact inner condition designated as the causal basis of each PA mode; 4. IH provenance DAG — the source condition/state and inheritance depth of every IH node; 5. PH phenotype-profile graph — which whole profiles are explicitly possessed, their source identities, any known profile membership, and which concrete trait details remain unspecified. Discarding any one of these can produce a different class of error. 64. Do not flatten inheritance An optimizer must not simplify 𝐼𝐻𝐼𝐻𝑆 ( ) ( ) to 𝐼𝐻𝑆 ( ) merely because both eventually project to . Such a simplification destroys the stage-depth generator. 𝑆 Likewise it must not replace source-sensitive nodes merely because their Boolean projections are equivalent. 65. Do not invent inherited provenance If the proof engine knows 𝑆⇒𝑇 and sees
Source Canon: Verbatim mathematical and modal logic. Interactive navigation and operator lookups available at /#hgl-part:48.