Constructive set theoretic models of typed combinatory logic

Journal of Symbolic Logic 58 (1):99-118 (1993)
We shall present two novel ways of deriving simply typed combinatory models. These are of interest in a constructive setting. First we look at extension models, which are certain subalgebras of full function space models. Then we shall show how the space of singletons of a combinatory model can itself be made into one. The two and the algebras in between will have many common features. We use these two constructions in proving: There is a model of constructive set theory in which every closed extensional theory of simple typed combinatory logic is the theory of a full function space model
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275327
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,470
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
Luis Elpidio Sanchis (1967). Functionals Defined by Recursion. Notre Dame Journal of Formal Logic 8 (3):161-174.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

11 ( #381,669 of 1,925,562 )

Recent downloads (6 months)

1 ( #418,152 of 1,925,562 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.