No CrossRef data available.
Article contents
Constructive set theoretic models of typed combinatory logic
Published online by Cambridge University Press: 12 March 2014
Abstract
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 simply typed combinatory logic is the theory of a full function space model.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1993