Graduate studies at Western
Journal of Symbolic Logic 58 (1):99-118 (1993)
|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 simple typed combinatory logic is the theory of a full function space model|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Stephen Donaho (2002). Standard Quantification Theory in the Analysis of English. Journal of Philosophical Logic 31 (6):499-526.
Katalin Bombó (2005). The Church-Rosser Property in Symmetric Combinatory Logic. Journal of Symbolic Logic 70 (2):536 - 556.
J. Roger Hindley (1972). Introduction to Combinatory Logic. Cambridge [Eng.]University Press.
Andrea Cantini (2003). The Axiom of Choice and Combinatory Logic. Journal of Symbolic Logic 68 (4):1091-1108.
Steve Awodey (2008). A Brief Introduction to Algebraic Set Theory. Bulletin of Symbolic Logic 14 (3):281-298.
Maarten Wicher Visser Bunder (1969). Set Theory Based on Combinatory Logic. Groningen, V. R. B. --Offsetdrukkerij (Kleine Der a 3-4).
Katalin Bimbó (2012). Combinatory Logic: Pure, Applied, and Typed. Taylor & Francis.
Ingemarie Bethke (1987). On the Existence of Extensional Partial Combinatory Algebras. Journal of Symbolic Logic 52 (3):819-833.
Jaap van Oosten (2011). Partial Combinatory Algebras of Functions. Notre Dame Journal of Formal Logic 52 (4):431-448.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #292,381 of 739,325 )
Recent downloads (6 months)0
How can I increase my downloads?