无语法一阶证明
First-order proofs without syntax
摘要:
传统上,证明是句法的、归纳生成的对象。本文重新制定了一阶逻辑(谓词演算)的证明,这是图论的,而不是语法。它定义了一个组合证明的公式$ϕ$作为一个松散的纤维化的图与$ϕ$。主要定理是可靠性和完备性:一个公式是有效的当且仅当它有一个组合证明。
英文摘要:
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula $ϕ$ as a lax fibration over a graph associated with $ϕ$. The main theorem is soundness and completeness: a formula is a valid if and only if it has a combinatorial proof.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。