arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.04436math.LOcs.LO
收藏

具有未定义真假值的正则谓词逻辑的完备性证明

A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value

Antti Valmari, Lauri Hella

摘要:

我们提供了一个健全的和完整的证明系统Kleene的三元逻辑谓词的扩展。理论的概念是扩展的,对于每个函数符号,一个公式,指定何时定义的功能。“被定义”的概念通过一个简单的递归算法扩展到术语和公式。“已定义”公式的构造使得它们本身总是已定义的。完整性证明依赖于Henkin构造。对于每一个公式,公式、它的否定和它的“被定义”公式的否定之一在构造的模型上是真的。许多其他三进制逻辑在文献中可以减少到我们的。部分函数在计算机科学中无处不在,甚至在学校的方程求解中也是如此。我们的工作的动机是试图解释,正是在逻辑方面,典型的非正式方法的推理,在这样的应用。

英文摘要:

We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of "is defined" is extended to terms and formulas via a straightforward recursive algorithm. The "is defined" formulas are constructed so that they themselves are always defined. The completeness proof relies on the Henkin construction. For each formula, precisely one of the formula, its negation, and the negation of its "is defined" formula is true on the constructed model. Many other ternary logics in the literature can be reduced to ours. Partial functions are ubiquitous in computer science and even in (in)equation solving at schools. Our work was motivated by an attempt to explain, precisely in terms of logic, typical informal methods of reasoning in such applications.

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

↑