Keywords
- Computable Function
- Standard Numbering
- Admissible Representation
- Recursion Theory
- Final Topology
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
ABERTH, O.: Computable analysis, Mc Graw-Hill, New York, 1980.
BISHOP, E.: Foundations of constructive analysis, Mc Graw-Hill, New York, 1967.
BRIDGES, D.S.: Constructive functional analysis, Pitman, London, 1979.
BROUWER, L.E.J.: Zur Begrūndung der intuitionistischen Mathematik I,II,III, Math. Annalen 93 (1924), 244–258, 95 (1925), 453–473, 96 (1926), 451–489.
CEITIN, G.S.: Algorithmic operators in constructive metric spaces. Trudy Mat.Inst.Steklov 67 (1962), 295–361. English translation: Amer. Math. Soc. Trans. (2) 64 (1967), 1–80.
EGLI, H.; CONSTABLE, R.L.: Computability concepts for programming languages semantics, TCS 2 (1976) 133–145.
ERSHOV, JU.L.: Theorie der Numerierungen I, Z.f. math. Logic 19 (1973), 289–388.
GRZEGORCZYK, A.: On the definition of computable real continuous functions, Fund. Math. 44 (1957), 61–71.
KLAUA, D.: Konstruktive Analysis, Deutscher Verlag der Wissenschaften, Berlin, 1961.
KO, K.; FRIEDMANN, H.: Computational complexity of real functions, TCS 20 (1982) 323–352.
KREITZ, C.; WEIHRAUCH, K.: Complexity theory on real numbers and functions, Proc. 6th GI-Conf., Lecture Notes on comp. Sci. 145 (1982) 165–174.
KREITZ, C.; WEIHRAUCH, K.: Theory of representations (to appear) Towards a theory of representations, Informatik Berichte 40, Fernuniversitāt Hagen (1983).
KREITZ, C.; WEIHRAUCH, K.: Compactness in constructive analysis revisited (to appear).
KUSHNER, B.A.: Lectures on constructive mathematical analysis, Monographs in mathematical logic and foundations of mathematics, Izdat. "Nauka", Moskau, 1973.
LORENZEN, P.: Differential und Integral — eine konstruktive Einführung in die klassische Analysis, Akademische Verlagsgesellschaft, Frankfurt a.M. 1965.
MAL'CEV, A.I.: Algorithms and recursive functions, Wolters-Noordhoff, Groningen, 1970
MYHILL, J.; SHEPHERDSON, J.C.: Effective operations on partial recursive functions, Zeitschrift f. math. Logik 1 (1955), 310–317.
NERODE, A.: Lecture on "Constructive analysis", 1982 Summer Institute on recursion theory, Cornell University.
POUR-EL, M.B.: RICHARDS, I.: LP-computability in recursive analysis, Technical Report University of Minnesota (1983).
ROGERS, H. jr.: Theory of recursive functions and effective computability, Mc Graw-Hill, New York, 1967.
SCOTT, D.: Data Types as lattices, SIAM J. Comp. 5 (1976), 522–587.
SPREEN, D.: Effective operations in a topological setting,technical report, RWTH Aachen, 1983.
WEIHRAUCH, K.: Type 2 recursion theory (to be published).
WEIHRAUCH, K.; KREITZ, C.: Representations of the real numbers and of the open subsets of the set of real numbers (to appear).
DEIL, T.: Darstellungen und Berechenbarkeit reeller Zahlen, Dissertation, Fernuniversität Hagen, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Kreitz, C., Weihrauch, K. (1984). A unified approach to constructive and recursive analysis. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099489
Download citation
DOI: https://doi.org/10.1007/BFb0099489
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13901-0
Online ISBN: 978-3-540-39119-7
eBook Packages: Springer Book Archive
