arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2606.03063cs.LOcs.CL
收藏

ZX-演算:迹索引依赖类型与认知语义

ZX-Calculus:Trace-Indexed Dependent Types and Epistemic Semantics

School of Information Science, Beijing Language and Culture University(北京语言文化大学信息科学学院)

Peng Chen

AI总结:

提出ZX-演算,通过迹索引类型、预层非单调语义和构造性AGM信念修正,保守扩展Martin-Löf依赖类型论,并给出Coq机械化证明。

摘要:

我们提出ZX-演算(知识演化演算),它是Martin-Löf依赖类型论(MLTT)的保守扩展,集成了迹索引类型、预层非单调语义和构造性AGM信念修正。本文附带Coq机械化证明(34个完整证明;两个核心结果零未完成)。(I)迹类型。FinTrace(s0,sn)是一个带类型的执行迹的归纳族。FinTrace和Star(Step)作为路径类型同构,但判断上不相等;TraceElim显式暴露事件标签e:Event,为事件驱动归纳提供了更符合人体工程学的接口。我们证明了迹可达性对应、确定性重放以及通过可归约候选(带传输引理,RC-elim推迟;所有其他核心结果经Coq验证)的规范性框架。(II)层语义。迹索引命题是自由迹偏序范畴Tf上的逆变层。分离定理(显式反模型)区分了证明论单调性和语义非单调性。项模型是初始CwF(句法泛性质,非经典完备性)。(III)AGM信念修正。我们给出了一个显式的构造性部分交收缩算法,经(C1)-(C4)验证。所有八条AGM公设(R1)-(R8)都是定理。R7和R8的证明使用了析取加固引理,并给出了自包含的构造性推导。(IV)集成。B^AGM在顺序修正中不满足层复合律BP-comp(显式反模型,Coq验证)。我们引入单步修正系统(SSRS),证明B^AGM是有效的SSRS(Coq验证),并表明这足以处理迹态射、收缩刻画和修正见证。BP-comp失败揭示了路径依赖信念修正与函子一致性之间的基本张力,此前未被识别。

英文摘要:

We propose ZX-Calculus (Knowledge Evolution Calculus), a conservative extension of Martin-Lof Dependent Type Theory (MLTT) integrating trace-indexed types, presheaf non-monotone semantics, and constructive AGM belief revision. A Coq mechanisation accompanies the paper (34 complete proofs; zero admits for the two central results). (I) Trace types. FinTrace(s0,sn) is an inductive family of typed execution traces. FinTrace and Star(Step) are isomorphic as path types but not judgementally equal; TraceElim exposes the event label e:Event explicitly, giving a more ergonomic interface for event-driven induction. We prove the Trace-Reachability Correspondence, Deterministic Replay, and a canonicity framework via reducibility candidates with a Transport Lemma (RC-elim deferred; all other Core results are Coq-verified). (II) Sheaf semantics. Trace-indexed propositions are contravariant sheaves over the free trace partial-order category Tf. A Separation Theorem (explicit countermodel) distinguishes proof-theoretic monotonicity from semantic non-monotonicity. The term model is an initial CwF (syntactic universal property, not classical completeness). (III) AGM belief revision. We give an explicit constructive partial meet contraction algorithm verified against (C1)-(C4). All eight AGM postulates (R1)-(R8) are theorems. Proofs of R7 and R8 use the Disjunctive Entrenchment Lemma, given a self-contained constructive derivation. (IV) Integration. B^AGM fails the sheaf composition law BP-comp for sequential revision (explicit countermodel, Coq-verified). We introduce Single-Step Revision Systems (SSRS), prove B^AGM is a valid SSRS (Coq-verified), and show this suffices for trace morphisms, retraction characterisation, and revision witnesses. The BP-comp failure reveals a fundamental tension between path-dependent belief revision and functor consistency, not previously identified.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑