What is taken from the Enter framework

Cheung's Enter calculus distinguishes a specified Born semantics from a separate characterization of an unknown measurement strategy CheungEnter,CheungI. Here we use the first distinction: allocation, coherent gates, destructive readout, and classical control are explicitly specified.

We do not derive Born's rule from a causal graph. Nor do we transfer the uniqueness theorem of I.tex to a class with apparatus-dependent hidden state. Our quantum calculations use printed CPTP maps and Born readout from the outset.

VII-J supplies a documentary scheduled-ancestor interface CheungVIIJ. Its finite support assertion is restated and proved below. The scalar input-stability and causal-accounting discussion in Em06-B is a methodological comparison CheungEm06B; no field equation, metric coefficient, or scalar response map is imported.

Psy02-B distinguishes complete process laws from mechanism identification CheungPsy02B. Psy03-B gives a classical-register example of reduced history dependence CheungPsy03B. Psy03-C distinguishes carrier contraction from persistent register information CheungPsy03C. Psy03-D separates supplied observations from hidden-rule inference CheungPsy03D. These are source interfaces, not unidentified premises.