Hostname: page-component-8448b6f56d-jr42d Total loading time: 0 Render date: 2024-04-23T11:26:38.177Z Has data issue: false hasContentIssue false
  • English
  • Français

Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals

Published online by Cambridge University Press:  12 March 2014

Marc Bezem
Marc Bezem*
Affiliation:
Korenbloemstraat 44, 3551 Gn Utrecht, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper a model for barrecursion is presented. It has as a novelty that it contains discontinuous functionals. The model is based on a concept called strong majorizability. This concept is a modification of Howard's majorizability notion; see [T, p. 456].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 50 , Issue 3 , September 1985 , pp. 652 - 660
Copyright
Copyright © Association for Symbolic Logic 1985

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

[S]Spector, C., Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, Recursive function theory (Dekker, J. C. E., editor), Proceedings of Symposia in Pure Mathematics, vol. 5, American Mathematical Society, Providence, Rhode Island, 1962, pp. 1–27.CrossRefGoogle 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