Hostname: page-component-cb9f654ff-mwwwr Total loading time: 0 Render date: 2025-08-18T22:14:30.352Z Has data issue: false hasContentIssue false
  • English
  • Français

Constructive set theoretic models of typed combinatory logic

Published online by Cambridge University Press:  12 March 2014

Andreas Knobel
Andreas Knobel*
Affiliation:
Computer Language Section, Computer Science Division, Electrotechnical Laboratory, Tsukuba 305, Japan, E-mail: andreas@etl.go.jp
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 58 , Issue 1 , March 1993 , pp. 99 - 118
Copyright
Copyright © Association for Symbolic Logic 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[BCL85]Berry, G., Curien, P. L., and Levy, J. J., Full abstraction for sequential languages: the state of the art. Algebraic methods in semantics (Nivat, M. and Reynolds, J., editors), Cambridge University Press, Cambridge, 1985.Google Scholar
[Bel77]Bell, J. L., Boolean-valued models and independence proofs in set theory, Oxford University Press, Oxford, 1977.Google Scholar
[dV89]de Vries, F.-J., Type theoretical topics in topos theory, PhD thesis, University of Utrecht, 1989.Google Scholar
[Fou80]Fourman, M. P., Sheaf models for set theory, Journal of Pure and Applied Algebra, vol. 19 (1980), pp. 91–101.CrossRefGoogle Scholar
[FS79]Fourman, M. P. and Scott, D. S., Sheaves and logic, Applications of sheaf theory to algebra, analysis, and topology (Mulvey, C. J., Fourman, M. P. and Scott, D. S., editors), Springer, Berlin, 1979.Google Scholar
[Hay81]Hayashi, S., On set theory in toposes, Logic Symposia, Hakone, Berlin, 1981, pp. 23–29.Google Scholar
[Hyl82]Hyland, M., The effective topos, The L.E.J. Brouwer centenary symposium, (Troelstra, A. S. and van Dalen, D., editors), North-Holland, Amsterdam, 1982.Google Scholar
[Joh77]Johnstone, P. T., Topos theory. Academic Press, New York and London, 1977.Google Scholar
[Kno]Knobel, A., Constructive λ-models, Journal of Pure and Applied Alegbra, (to appear).Google Scholar
[Kno90]Knobel, A., Constructive λ-models, PhD thesis, Edinburgh University, 1990.Google Scholar
[LS86]Lambek, J. and Scott, P. J., Introduction to higher order categorical logic, Cambridge studies in advanced mathematics, vol. 7, Cambridge University Press, Cambridge, 1986.Google Scholar
[Plo77]Plotkin, G. D., Lcf considered as a programming language, Theoretical Computer Science, vol. 5 (1977), pp. 223–256.CrossRefGoogle Scholar
[San67]Sanchis, L. E., Functionals defined by recursion, Notre Dame Journal of Formal Logic, vol. 8(1967), pp. 161–174.CrossRefGoogle Scholar
[Sco80]Scott, D. S., Relating theories of the λ-calculus, To H.B. Curry: essays on combinatory logic, lambda calculus and formalisms (Hindley, J. R. and Seldin, J. P., editors), Academic Press, New York and London, 1980, pp. 403–450.Google Scholar
[Sta85]Statman, R., Logical relations and the typed lambda calculus. Information and Control, vol. 65 (1985), pp. 85–97.CrossRefGoogle Scholar
[TVD88]Troelstra, A. S. and van Dalen, D., Constructivism in Mathematics, vol. I, II, North-Holland, Amsterdam, 1988.Google Scholar