Event Ontology: Deterministic Signed Actualization over a Supplied Directed Graph

Abstract

We propose an event ontology with deterministic signed actualization over a supplied directed graph. Each event has capacity, magnitude, and polarity. These scalars determine coupling weights and a spontaneous base. A synchronous, irreversible threshold rule determines one actualized set and its admission ranks. Finite in-degree gives natural-number ranks and closure by stage ω. An equivalent rank equation characterizes the same assignment. Rank records derivation depth; its definition assumes no physical clock. A three-event counterexample shows that the prune-regrow rival need not converge. Operative reachability yields a strict partial order, and normalized crossing attribution sums to one over spontaneous origins. A separate deletion-based dependence test covers examples of mediated prevention and double prevention, with limitations in reserve prevention and late preemption. Absent events contribute no drive and cannot be candidate causes, though their possible activation can matter to counterfactual dependence. The mathematical components have precedents; the proposal concerns their joint event interpretation and scalar restrictions. The graph and scalar assignments remain primitive inputs. Recovering physical position and temporal structure remains open.