Modal Pure Type Systems

被引：5
|
作者：
Tijn Borghuis
机构：
[1] Eindhoven University of Technology,Department of Mathematics and Computing Science
来源：
Journal of Logic, Language and Information | 1998年 / 7卷 / 3期
关键词：
Knowledge representation; natural deduction; normal modal logics; typed λ-calculus;
D O I：
10.1023/A:1008254612284
中图分类号：
学科分类号：
摘要：
We present a framework for intensional reasoning in typed λ-calculus. In this family of calculi, called Modal Pure Type Systems (MPTSs), a “propositions-as-types”-interpretation can be given for normal modal logics. MPTSs are an extension of the Pure Type Systems (PTSs) of Barendregt (1992). We show that they retain the desirable meta-theoretical properties of PTSs, and briefly discuss applications in the area of knowledge representation.
引用
收藏
页码：265 / 296
页数：31
相关论文
共 50 条
12345