This paper develops an execution calculus for interacting binary relations from two requirements: R1, governance changes must be admitted under the same rule as domain events, and R2, historical admission judgments must admit deterministic verification replay. An extensional relation alone does not retain completed candidates, causal inputs, governing versions, or positive admission evidence. We introduce an ontological–eschatological–epistemic (OEE) lifting and a static execution architecture S1 with an append-only shared record, partial single-valued realization, independent total Boolean admission, immutable versioned specifications, and replayable evidence. Axiom 0 is characterized as the unique deterministic, faithful, non-withholding admission dynamics preserving S1 (Theorem A). S1 with Axiom 0 satisfies R1 and R2 (Theorem B), and none of its essential conditions can be omitted (Theorem C). For coded finitely branching fixed regimes, S1 induces a Scott execution domain with a three-status semantics of execution possibility. Execution-contract-preserving morphisms transport admitted traces, and recorded merges localize nondeterminism in interacting systems. The lifting separates operational completion, Boolean admission, fixed-regime reachability, and governed evolution between regimes as typed modalities of execution, and identifies ontology–criterion incompatibility and missing event-horizon interaction as structural sources of non-progress for which an admitted governing change may enable repair. A worked construction of a computable Dedekind cut with interacting number streams, and a factorization chain reusing admitted certificates, illustrate these obligations. The formalism is methodologically agnostic within the bounds set by S1.