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

全高阶集上不等式推理的完备性结果

A Completeness Result for Inequational Reasoning in a Full Higher-Order Setting

Lawrence S. Moss, Thomas F. Icard

摘要:

本文得到了一个完整的结果,不平等的推理与应用条款,没有变量的设置,其中预期的语义模型是完整的结构,完整的类型层次结构的基础类型的前序。语法允许指定给定的符号被解释为单调函数,或反调函数,或两者兼而有之。有一套自然的五个规则不等式推理。可以添加变量,也可以添加替换规则,但我们观察到,这种逻辑对于完整的结构是不完整的。这就是为什么本文中的完备性结果适用于没有变量的项。由于一般(Henkin)结构类的完备性是已知的,我们对全结构感兴趣。我们提出了一个完备性定理。我们的结果不是最优的,因为我们限制了具有弱完备性的基前序:每对元素都有一个上界和一个下界。为了弥补这一点,我们在逻辑中加入了几条规则。我们还提出了我们的完整性结果的扩展和变化。

英文摘要:

This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base types. The syntax allows for the specification that a given symbol be interpreted as a monotone function, or an antitone function, or both. There is a natural set of five rules for inequational reasoning. One can add variables and also add a substitution rule, but we observe that this logic would be incomplete for full structures. This is why the completeness result in this paper pertains to terms without variables. Since the completeness is already known for the class of general (Henkin) structures, we are interested in full structures. We present a completeness theorem. Our result is not optimal because we restrict to base preorders which have a weak completeness property: every pair of elements has an upper bound and a lower bound. To compensate we add several rules to the logic. We also present extensions and variations of our completeness result.

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

↑