arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.13018cs.LOmath.LO
收藏

支持是搜索

Support is Search

University of Southampton(南安普顿大学);University College London(伦敦大学学院)

Alexander V. Gheorghiu

AI总结:

本文探讨了固定基底下的支持关系,通过将公式编码为逻辑程序目标,证明支持与第二阶遗传Harrop逻辑程序的证明搜索一致,为基底扩展语义提供了构造性解释。

摘要:

Sandqvist的基底扩展语义为直觉命题逻辑定义了支持关系,该关系参数化于原子基底,有效性被定义为在每个基底中的支持。Sandqvist的完备性定理回答了全局问题:哪些公式是有效的?本文则探讨局部问题:给定一个固定的基底,该基底中的支持对应于什么?我们证明,在固定的基底中的支持与第二阶遗传Harrop逻辑程序的证明搜索一致,通过将公式编码为逻辑程序目标。这种编码通过持续传递风格读取语义子句,揭示出那些子句中的全称量词 over 基底扩展和原子并非是对一个完成整体的域范围量词,而是由标准的新鲜度纪律所支配的特征变量。基底扩展语义因此获得了完全构造性和计算上透明的解释:支持即证明搜索。该结果补充了Sandqvist的全局定理,以局部对应的方式验证了该框架的反实在主义基础,并为在建模任务中实现语义开辟了途径。

英文摘要:

For intuitionistic propositional logic, Sandqvist's base-extension semantics defines a support relation parametrised by atomic bases, with validity identified as support in every base. Sandqvist's completeness theorem answers the global question: which formulae are valid? This paper addresses the local question: given a fixed base, what does support in that base correspond to? We show that support in a fixed base coincides with proof-search in a hereditary Harrop logic program with a quantifier over atoms, via an encoding of formulae as logic programming goals. The encoding is a variant of the Russell-Prawitz translation of the connectives, with quantification restricted to atoms, and it is obtained by reading the semantic clauses in continuation-passing style. So read, the universal quantifiers over base extensions and atoms in those clauses need not range over a completed totality: they are eigenvariables under a standard freshness discipline. Base-extension semantics thereby acquires an explicit computational content: support is proof-search. The result complements Sandqvist's global theorem with a local correspondence and makes the constructive character of the framework explicit.

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

↑