paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Resolving finite indeterminacy

消解有限不确定性
LICS Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science2020匹配度 1/10 · 该论文属于纯逻辑/证明论方向,讨论相干/几何逻辑中动态方法消解理想对象与非确定性相继式的保守性,与用户关注的 PL→AI、AI→PL、浮点程序分析、贝叶斯程序分析及 LLM/Agent 交叉均无直接关联。引用 12 inbox
Peter Schuster, Daniel Wessel
crossref: 2026-09-12

AI 速览

一句话:利用动态方法在相干/几何逻辑中以证明树的有限分支消解理想对象,证明非确定性相继式的语义保守性。

抽象代数中常借助佐恩引理等引入理想对象,以证明带有有限但未必单一后继的非确定性相继式的语义保守性。动态方法被设计用来消除这类理想对象,其可行性部分源于相关领域以(有限)相干逻辑或几何逻辑为主:非确定性公理的运用可由证明树的有限分支来刻画。本文围绕有限不确定性,说明如何在这种证明论框架下动态消解理想对象,从而为语义保守性提供构造性处理。摘要未报告具体实现或实验评估。

问题
抽象代数中的理想对象(常由 Zorn 引理保证)被用于证明具有有限但非单一后继的非确定性相继式的语义保守性;如何动态消除这些理想对象是核心问题。
方法
采用动态方法,在(有限)相干/几何逻辑框架下,用证明树的有限分支刻画非确定性公理的使用,从而消解理想对象。
评估
以逻辑与证明论分析为主,摘要未给出实验或案例评估。
原文摘要(Abstract)

Dynamical methods were designed to eliminate the ideal objects abstract algebra abounds with. Typically granted by an incarnation of Zorn's Lemma, those ideal objects often serve for proving the semantic conservation of additional non-deterministic sequents, that is, with finite but not necessarily singleton succedents. Eliminating ideal objects dynamically was possible also because (finitary) coherent or geometric logic predominates in that area: the use of a non-deterministic axiom can be captured by a finite branching of the proof tree.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot5494,
  title = {Resolving finite indeterminacy},
  author = {Peter Schuster and Daniel Wessel},
  booktitle = {LICS},
  year = {2020},
  doi = {10.1145/3373718.3394777}
}