paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Modal Functional (Dialectica) Interpretation

模态函数式(Dialectica)解释
LMCS vol.Volume 17, Issue 42021匹配度 1/10 · 论文属于证明论与模态逻辑中的 Dialectica 函数解释,与用户关注的静态分析、LLM/Agent 程序分析、浮点程序分析或贝叶斯程序分析均无直接交集;仅与形式化验证的基础逻辑有很间接的联系。引用 0 inbox
Dan Hernest, Trifon Trifonov
crossref: 2026-09-10

AI 速览

一句话:将轻量 Dialectica 解释扩展到模态公式,并证明其对基于 Gödel T 与经典 S4 的非标准模态算术可靠。

本文把轻量 Dialectica 解释扩展到通常与轻量模态公式(含布尔和自然数变量全称量化),并证明其对基于 Gödel T 与经典 S4 的非标准模态算术可靠。轻量模态 Dialectica 的目标是通常的非模态有限类型经典算术(含布尔类型),其命题核心为布尔而非 S4。作者提出“重”模态 Dialectica:该技术无法在原有轻量解释中模拟,合成泛函不劣于旧法而翻译过程更优。最后,经典 S5 定义公理的 realizer 存在性被归约为 Smullyan 的饮酒原则。

问题
如何把轻量 Dialectica 函数解释推广到模态公式,并为其建立可靠的非标准模态算术目标?
方法
将通常与轻量模态公式解释到非模态有限类型经典算术,构造轻量与“重”模态 Dialectica 解释,并证明其相对 Gödel T 与经典 S4 的可靠性。
评估
通过可靠性证明、对合成泛函与翻译过程的比较,以及将经典 S5 定义公理的 realizer 存在性归约到饮酒原则来展示新解释的优势。
原文摘要(Abstract)

We adapt our light Dialectica interpretation to usual and light modal formulas (with universal quantification on boolean and natural variables) and prove it sound for a non-standard modal arithmetic based on Goedel's T and classical S4. The range of this light modal Dialectica is the usual (non-modal) classical Arithmetic in all finite types (with booleans); the propositional kernel of its domain is Boolean and not S4. The `heavy' modal Dialectica interpretation is a new technique, as it cannot be simulated within our previous light Dialectica. The synthesized functionals are at least as good as before, while the translation process is improved. Through our modal Dialectica, the existence of a realizer for the defining axiom of classical S5 reduces to the Drinking Principle (cf. Smullyan).

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot1272,
  title = {Modal Functional (Dialectica) Interpretation},
  author = {Dan Hernest and Trifon Trifonov},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 17, Issue 4},
  year = {2021},
  doi = {10.46298/lmcs-17(4:3)2021}
}