Automated Deduction in Classical and Non-Classical Logics

Automated Deduction in Classical and Non-Classical Logics
复制标题

经典和非经典逻辑的自动演绎

DOI:
--
复制
发表时间:
2002
期刊:
Lecture Notes in Computer Science
影响因子:
--
通讯作者:
G. Salzer
G. Salzer
中科院分区:
--
文献类型:
--
作者:
R. Caferra;G. Salzer

文献摘要

被引文献

相似文献

归结模是一个一阶定理证明方法,可以应用于简单类型论(也称为高阶逻辑)和集合论的一阶表示。当它被应用到一些一阶表示的类型论,它模拟了更高的阶分辨率。在本文中,我们比较了它在类型论上的行为
Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations of type theory, it simulates exactly higherorder resolution. In this note, we compare how it behaves on type theory