|Abstract||The paper presents Property Theory with Curry Typing (PTCT) where the language of terms and well-formed formulæ are joined by a language of types. In addition to supporting fine-grained intensionality, the basic theory is essentially first-order, so that implementations using the theory can apply standard first-order theorem proving techniques. The paper sketches a system of tableau rules that implement the theory. Some extensions to the type theory are discussed, including type polymorphism, which provides a useful analysis of conjunctive terms. Such terms can be given a single polymorphic type that expresses the fact that they can conjoin phrases of any one type, yielding an expression of the same type.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Giuseppe Primiero & Mariarosiaria Taddeo (2012). A Modal Type Theory for Formalizing Trusted Communications. Journal of Applied Logic 10 (1):92-114.
Wayne Aitken & Jeffrey A. Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Jeffrey Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
W. W. Tait (2003). The Completeness of Heyting First-Order Logic. Journal of Symbolic Logic 68 (3):751-763.
Chris Fox & Shalom Lappin, Doing Natural Language Semantics in an Expressive First-Order Logic with Flexible Typing.
Chris Fox & Shalom Lappin, An Expressive First-Order Logic with Flexible Typing for Natural Language Semantics.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads5 ( #160,239 of 549,010 )
Recent downloads (6 months)0
How can I increase my downloads?