期刊文献+

类型一阶逻辑的理论证明探讨

Theoretical Proof of Typed First-order Logic
下载PDF
导出
摘要 类型一阶逻辑在传统的一阶逻辑上,引入了类型,它是多态多类逻辑程序设计语言的理论基础,对编译系统设计与实现的进一步发展具有重要意义。论文在类型一阶逻辑的理论层面进行了探讨,引入了基本简单导出的可靠性定理和等值符号的可替换性定理,并予以证明。通过这两个定理,可以简化类型一阶逻辑理论证明中的工作量,使得将来的理论研究更加方便。 Type is introduced into the typed first-order logic,which is based on the traditional first-order logic and the theoretical foundation of polymorphic and polytypic logic programming language. Typed first-order is significant to the further development of the design and implementation of compilation system. This paper is a research at the theoretical level and it introduces reliability theorem of the basic and simple derivation and the exchangeability theorem of the equivalent symbols,and the two theorems are proved in this paper. With the two theorems,the workload of the first-order logic proof can be simplified and the future theoretical research will be easier.
作者 徐丹 XU Dan (Department of Computer Science of Xiamen University,Xiamen 361005,China)
出处 《电脑知识与技术》 2010年第3期1657-1659,共3页 Computer Knowledge and Technology
关键词 一阶类型逻辑 B类型简单导出 原子简单导出 可靠性 可替换性定理 typed first-order logic B-typed simple derivation atomic simple derivation reliability exchangeability theorem
  • 相关文献

参考文献2

  • 1Hill P M,Lloyd J W.The Godel programming Language[M].London:MIT Press,1994.
  • 2胡世华,陆钟万.数理逻辑基础(上,下)[M].北京:科学出版社,1980.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部