Introduction, inheritance, and scope

The Enter calculus separates a specified concrete semantics from a characterization problem for an unknown measurement transition. In the concrete semantics, destructive readout has Born probabilities and projective residual rays by definition. In the characterization problem, those probabilities and residuals are unknown, while the qubit kinematics, coherent gates, allocation, typing, and observation interfaces remain fixed.

Manuscript I identifies the Born strategy within its declared structural class using composability, no-signaling, nullity, continuity, and a typed record equation I (labels ass:strategy-class, def:requirements, and thm:main). That theorem quantifies over unbounded finite resources. It is not, without a separate resource audit, a theorem about strategies defined only up to a fixed capacity.

This paper makes that audit explicit. It has three distinct subjects:

1. a combinatorial update grammar and its cut monotones;

2. finite-capacity operational constraints on unknown readout strategies;

3. register accounting and finite computational diagnostics.

No implication between these subjects is left implicit.