Abstract
The paper explores the analogy between reducibility statements of Weihrauch's theory of representations and theorems of constructive mathematics which can be reformulated as inclusions between sets. Kleene's function-realizability is the key to understanding of the analogy, and suggests an alternative way of looking at the theory of reducibilities.
I am indebted to K.Weihrauch for discussions and helpful comments on an earlier version of this paper.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M.J.Beeson, Foundations of Constructive Mathematics, Springer-Verlag, Berlin 1985.
E. Bishop, D.S. Bridges, Constructive Analysis, Springer-Verlag, Berlin 1985.
E.A. Bishop, Foundations of Constructive Analysis (1967), McGraw Hill, New York.
H.M. Friedman, On the derivability of instantiation properties, The Journal of Symbolic Logic 42 (1977), 506–514.
S.C. Kleene, Formalized recursive functionals and formalized realizability, memoirs of the American mathematical Society 89 (1969).
C. Kreitz, K. Weihrauch, A unified approach to constructive and recursive analysis, in: M.M. Richter et al. (eds.), Computation and Proof theory, Springer-Verlag, Berlin 1984, 259–278.
C. Kreitz, K. Weihrauch, Theory of representations, Theoretical Computer Science 38 (1985), 35–53.
C. Kreitz, K. Weihrauch, Compactness in constructive analysis revisited, Annals of Pure and Applied Logic 36 (1987), 29–38.
N.Th. Müller, Computational complexity of real functions and real numbers. Informatik Berichte 59 (1986), Fern-Universität Hagen, BRD.
P. Martin-Löf, Intuitionistic Type Theory, Bibliopolis, Napoli.
N.A. Shanin, Constructive Real Numbers and Function Spaces, American Mathematical Society, providence (RI), 1968 (translation of the russian original).
A.S. Troelstra (ed.), Metamathematical investigation of Intuitionistic Arithmetic and Analysis, Springer verlag, berlin 1973.
A.S. Troelstra, D. van Dalen, Constructivism in Mathematics (1988), North-Holland Publ. Co., Amsterdam
J. van Oosten, Exercises in Realizability. Ph.D. thesis, Universiteit van Amsterdam, 1990.
K. Weihrauch, Type 2 recursion theory, Theoretical Computer Science 38 (1985), 17–33.
K. Weihrauch, Computability on computable metric spaces, Theoretical Computer Science, to appear.
K. Weihrauch, C. Kreitz, Representations of the real numbers and of the open subsets of the set of real numbers, Annals of Pure and Applied Logic 35 (1987), 247–260.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Troelstra, A.S. (1992). Comparing the theory of representations and constructive mathematics. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023783
Download citation
DOI: https://doi.org/10.1007/BFb0023783
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55789-0
Online ISBN: 978-3-540-47285-8
eBook Packages: Springer Book Archive