An Untyped Higher Order Logic with Y Combinator

Journal of Symbolic Logic 72 (4):1385 - 1404 (2007)
We define a higher order logic which has only a notion of sort rather than a notion of type, and which permits all terms of the untyped lambda calculus and allows the use of the Y combinator in writing recursive predicates. The consistency of the logic is maintained by a distinction between use and mention, as in Gilmore's logics. We give a consistent model theory, a proof system which is sound with respect to the model theory, and a cut-elimination proof for the proof system. We also give examples showing what formulas can and cannot be used in the logic.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1203350794
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,780
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

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
11 ( #443,966 of 2,214,632 )

Recent downloads (6 months)
1 ( #408,824 of 2,214,632 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature