We formalize a minimal setting in which a chronology (a strict partial order on events) is forced by consistency of distributed information under local composability. The system maintains distributed records interpreted as constraints over a global possibility space (Omega, Sigma), optionally with a measure mu. Events act locally by monotonically tightening records, and independent events commute (diamond/trace semantics), yielding schedule invariance. We define operational influence without assuming primitive time: e influences f if executing e can change what constraint f writes on a shared site. Influence cycles alone need not imply inconsistency, so we distinguish weak influence (dependence) from strong influence (exclusive branching on an observable predicate). Assuming global satisfiability of all reachable record states, the diamond property, monotone information writing, and a mild branch-determinacy axiom for witnessed exclusivity, we prove that strong influence is acyclic and therefore induces an intrinsic chronology. We also show trace invariance and minimality of the derived order, introduce a monotone information clock based on -log mu(feasible set), and give an escape taxonomy: any model that admits strong-influence cycles without inconsistency must violate global consistency, local composability, monotone writing, or branch determinacy.

翻译：我们在一个最小化设定中形式化地证明：在局部可组合性条件下，分布式信息的一致性必然迫使时序（事件间的严格偏序关系）的存在。该系统维护的分布式记录可解释为全局可能性空间（Ω, Σ）上的约束条件，可选择性地配备测度μ。事件通过单调收紧记录的方式在局部作用，且独立事件满足交换律（菱形/迹语义），从而产生调度不变性。我们在不假设原始时间的前提下定义操作影响：若执行事件e可能改变事件f在共享站点上写入的约束条件，则称e影响f。仅存在影响环并不必然导致不一致性，因此我们区分弱影响（依赖关系）与强影响（基于可观测谓词的互斥分支）。假设所有可达记录状态均满足全局可满足性、菱形性质、信息写入单调性，以及针对可观测互斥性的温和分支确定性公理，我们证明强影响关系具有无环性，从而诱导出内在时序。我们还证明了迹不变性及导出序的极小性，引入了基于-log μ(可行集)的单调信息时钟，并给出逃逸分类：任何允许强影响环存在却不导致不一致性的模型，必然违反全局一致性、局部可组合性、信息写入单调性或分支确定性中的至少一条。