Hostname: page-component-745bb68f8f-cphqk Total loading time: 0 Render date: 2025-01-12T05:42:21.410Z Has data issue: false hasContentIssue false
  • English
  • Français

On the existence of extensional partial combinatory algebras

Published online by Cambridge University Press:  12 March 2014

Ingemarie Bethke
Ingemarie Bethke*
Affiliation:
Centre for Cognitive Science, University of Edinburgh, Edinburgh EH8 91W, Scotland
Get access Rights & Permissions [Opens in a new window]

Abstract

The principal aim of this paper is to present a construction method for nontotal extensional combinatory algebras. This is done in §2. In §0 we give definitions of some basic notions for partial combinatory algebras from which the corresponding notions for (total) combinatory algebras are obtained as specializations. In §1 we discuss some properties of nontotal extensional combinatory algebras in general. §2 describes a “partial” variant of reflexive complete partial orders yielding nontotal extensional combinatory algebras. Finally, §3 deals with properties of the models constructed in §2, such as incompletability, having no total submodel and the pathological behaviour with respect to the interpretation of unsolvable λ-terms.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 52 , Issue 3 , September 1987 , pp. 819 - 833
Copyright
Copyright © Association for Symbolic Logic 1987

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.)

References

REFERENCES

[B] Barendregt, H. P., The lambda calculus, its syntax and semantics, North-Holland, Amsterdam, 1984.Google Scholar
[Be] Beeson, M. J., Foundations of constructive mathematics, Springer-Verlag, Berlin, 1985.CrossRefGoogle Scholar
[C-R] Church, A. and Rosser, J. B., Some properties of conversion, Transactions of the American Mathematical Society, vol. 39 (1936), pp. 472–482.CrossRefGoogle Scholar
[E] Engeler, E., Algebras and combinators, Algebra Universalis, vol. 13 (1981), pp. 389–392.CrossRefGoogle Scholar
[K] Klop, J. W., Extending partial combinatory algebras, Bulletin of the European Association for Theoretical Computer Science, no. 16 (02, 1982), pp. 30–34.Google Scholar
[P] Plotkin, G., A set-theoretical definition of application, Memo MIP-R-95, School of Artificial Intelligence, University of Edinburgh, Edinburgh, 1972.Google Scholar
[S] Schönfinkel, M., Über die Bausteine der mathematischen Logik, Mathematische Annalen, vol. 92 (1924), pp. 305–316.CrossRefGoogle Scholar
[Sc 1] Scott, D. S., Continuous lattices, Toposes, algebraic geometry and logic (Lawvere, E., editor), Lecture Notes in Mathematics, vol. 274, Springer-Verlag, Berlin, 1972, pp. 97–136.Google Scholar
[Sc2] Scott, D. S., Lambda calculus: some models, some philosophy, The Kleene symposium (Barwise, J. et al., editors), North-Holland, Amsterdam, 1980, pp. 223–265.CrossRefGoogle Scholar