Hostname: page-component-7bb8b95d7b-s9k8s Total loading time: 0 Render date: 2024-09-20T21:36:40.091Z Has data issue: false hasContentIssue false

Compact and majorizable functionals of finite type

Published online by Cambridge University Press:  12 March 2014

Marc Bezem*
Affiliation:
Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 Ab Amsterdam, The Netherlands

Extract

The main result of this paper will be that various notions of majorizability and compactness coincide in the full typestructure over the natural numbers. Moreover we shall show that the extensional typestructure of strongly majorizable functionals can be obtained by applying Zucker's construction ( )E to any of these coinciding intensional typestructures. A different result is proved in the typestructure of effective operations, where not every majorizable functional is compact. Finally we shall introduce the concept of relative compactness in the full typestructure and prove that there are just two degrees of compactness.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1989

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

[B1]Bezem, M., Isomorphisms between HEO and HROE, ECF and ICEE, this Journal, vol. 50 (1985), pp. 359371.Google Scholar
[B2]Bezem, M., Strongly majorizable functionals of finite type: a model for barrecursion containing discontinuous functionals, this Journal, vol. 50 (1985), pp. 652660.Google Scholar
[K]Kohlenbach, U., Majorisierbare Funktionale und rekursionstheoretische Modelle für W. Friedrichs Funktionalkalküle, Diplomarbeit, J. W. Goethe Universität, Frankfurt, 1986.Google Scholar
[T]Troelstra, A. S. (editor), Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer-Verlag, Berlin, 1973.CrossRefGoogle Scholar
[Z]Zucker, Z., Proof theoretic studies of systems of iterative inductive definitions and subsystems of analysis, Ph.D. thesis, Stanford University, Stanford, California, 1971.Google Scholar