Globality Typing and Domain Stratification of Propositions

A direct extension of Paper 00. Argues that “global” is often used as if it were a single scalar of strength, when in fact it quantifies over entirely different axes (time, space, data class, boundary, external forcing, parameters, solution concept, regularity, equation family, representation, proof system, physical realization). Establishes the Globality Typing Principle: globality is a typed profile, not a boolean or a single totally-orderable strength. Defines ScopeContract(Q) and an 11-axis globality profile GProf(Q). Uses NS as the first domain-stratification test case, distinguishing three domains — formal/Clay NS, physical NS realization, and the generalized NS-like family — and requires that any cross-domain theorem upgrade carry an explicit certificate, never resting on surface similarity between equations alone.