Modal pure type systems


Abstract
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.
Keywords Knowledge representation  natural deduction  normal modal logics  typed λ-calculus
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1008254612284
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 47,299
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
34 ( #272,619 of 2,290,950 )

Recent downloads (6 months)
1 ( #833,703 of 2,290,950 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature