Zusammenfassung
We investigate Gödel’s notion of a primitive recursive functional of higher type [5] in the context of partial continuous functionals as introduced by Kreisel in [7] and developed mainly by Scott (see [13], [3]). To make this paper readable for people not familiar with the theory of partial continuous functionals we have included a short exposition of the basic material, in a form convenient for our later arguments.
Part of the research reported here was done while I was visiting Carnegie-Mellon-University (Pittsburgh, Pennsylvania, USA) in the academic year 1987/88. Thanks are due to the Stiftung Volkswagenwerk for a grant which made this visit possible. I further want to thank Ulrich Berger, Steve Brookes, Daniel Leivant, Frank Pfenning, Dana Scott and Rick Statman for helpful discussions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
de Bruijn, N. G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Math. 34, 381–392 (1972)
Diller, J.: Zur Berechenbarkeit primitiv-rekursiver Funktionale endlicher Typen. In K. Schütte (ed.): Contributions to Mathematical Logic. North-Holland, Amsterdam 1968, pp. 109–120
Ershov, Yu. L.: Model C of partial continuous functionals. In R. Gandy and M. Hyland (eds.): Logic Colloquium 1976. North Holland, Amsterdam 1977, pp. 455–467
Friedman, H.: Equality between functionals. In R. Parikh (ed.): Logic Colloquium, Lecture Notes in Math. 453. Springer, Berlin 1975, pp. 22–37
Godel, K.: Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12,280–287 (1958)
Howard, W. A.: Ordinal analysis of terms of finite type. The Journal of Symbolic Logic, 45 (3), 493–504 (1980)
Kreisel, G.: Interpretation of analysis by means of constructive functionals of finite types. In A. Heyting (ed)• Constructivity in Mathematics. North Holland, Amsterdam 1959, pp. 101–128
Plotkin, G. D.: LCF considered as a programming language. Theoretical Computer Science. 5,223–255 (1977)
Plotkin, G. D.: 7“’ as a universal domain. Journal of Computer and System Sciences 17, 209–236 (1978)
Sanchis, L. E.: Functionals defined by recursion. Notre Dame Journal of Formal Logic 8, 161–174 (1967)
Schütte, K., Schwichtenberg, H.: Mathematische Logik. In G. Fischer et al. (eds.): Ein Jahrhundert Mathematik 1890–1990. Festschrift zum Jubiläum der DMV. Vieweg, Braunschweig 1990, pp. 717–740
Schwichtenberg, H.: Eine Normalform für endliche Approximationen von partiellen stetigen Funktionalen. In J. Diller (ed.): Logik und Grundlagenforschung, Festkolloquium zum 100. Geburtstag von Heinrich Scholz. Aschendorff, Münster 1986, pp. 89–95
Scott, D. S.: Domains for denotational semantics. In M. Nielsen, E. M. Schmidt (eds.): Automata, Languages and Programming. Lecture Notes in Computer Science 150, Springer, Berlin 1982, pp. 577–613
Statman, R.: Equality between functionals revisited. In L. A. Harrington et al. (eds.): Harvey Friedman’s Research on the Foundations of Mathematics. North Holland, Amsterdam 1985, pp. 331–338
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schwichtenberg, H. (1991). Primitive Recursion on the Partial Continuous Functionals. In: Broy, M. (eds) Informatik und Mathematik. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76677-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-76677-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-76678-7
Online ISBN: 978-3-642-76677-0
eBook Packages: Springer Book Archive