A real number structure that is effectively categorical

Mathematical Logic Quarterly

Volumn 45, Issue 2, 1999, Pages 147-182

  Hertling, Peter ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Computability over the real numbers; Effective categoricity; Effectivity for countable structures; Effectivity for uncountable structures; Numberings; Representations

Indexed keywords

EID: 0033450075     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.19990450202     Document Type: Article

References (41)

1. AVIZIENIS, A., Signed-digit number representations for fast parallel arithmetic. IRE Transactions on Electronic Computers 10 (1961), 389-400.
2. BISHOP, E., and D. S. BRIDGES, Constructive Analysis. Springer-Verlag, Berlin-Heidelberg-New York 1985.
3. BOURBAKI, N., Theory of Sets. Addison-Wesley, Reading, Mass., 1974.
4. BRATTKA, V., Recursive characterization of computable real-valued functions and relations. Theor. Comp. Science 162 (1996), 45-77.
5. BRATTKA, V., and P. HERTLING, Continuity and computability of relations. Technical Report 164, FernUniversität Hagen, September 1994.
6. BRENT, R. P., Fast multiple-precision evaluation of elementary functions. J. Assoc. Comp. Mach. 23 (1976), 242-251.
7. DEIL, T., Darstellungen und Berechenbarkeit reeller Zahlen. Technical Report 51, Fern-Universität Hagen, December 1984.
8. ERSHOV, JU. L., Theorie der Numerierungen I. Zeitschrift Math. Logik Grundlagen Math. 19 (1973), 289-388.
9. ERSHOV, JU. L., Theorie der Numerierungen II. Zeitschrift Math. Logik Grundlagen Math. 21 (1975), 473-584.
10. ERSHOV, JU. L., Theorie der Numerierungen III. Zeitschrift Math. Logik Grundlagen Math. 23 (1977), 289-371.
11. FRÖHLICH, A., and J. C. SHEPHERDSON, Effective procedures in field theory. Philos. Trans. Roy. Soc. London 248 (1956), 407-432.
12. GRZEGORCZYK, A., Computable functionals. Fund. Math. 42 (1955), 168-202.
13. GRZEGORCZYK, A., On the definitions of computable real continuous functions. Fund. Math. 44 (1957), 61-71.
14. HAUCK, J., Zur Präzisierung des Begriffs berechenbare reelle Funktion. Zeitschrift Math. Logik Grundlagen Math. 17 (1971), 295-300.
15. HAUCK, J., Berechenbare reelle Funktionen. Zeitschrift Math. Logik Grundlagen Math. 19 (1973), 121-140.
16. HAUCK, J., Konstruktive Darstellungen in topologischen Räumen mit rekursiver Basis. Zeitschrift Math. Logik Grundlagen Math. 26 (1980), 565-576.
17. HERTLING, P., Effectivity and effective continuity of functions between computable metric spaces. In: Combinatorics, Complexity, and Logic, Procedings of DMTCS'96, Auckland (D. S. BRIDGES et al., eds.), Springer-Verlag, Singapore 1997, pp. 264-275.
18. KHOUSSAINOV, B., and R. SHORE, Categoricity and Scott families. In: Combinatorics, Complexity, and Logic, Procedings of DMTCS'96, Auckland (D. S. BRIDGES et al., eds.), Springer-Verlag, Singapore 1997, pp. 299-307.
19. KO, K.-I., Complexity Theory of Real Functions. Birkhäuser, Boston-Basel 1991.
20. KREISEL, G., D. LACOMBE, and J. R. SHOENFIELD, Partial recursive functional and effective operations. In: Constructivity in Mathematics, Proceedings of the Colloquium held at Amsterdam 1957 (A. HEYTING, ed.), North-Holland Publ. Comp., Amsterdam 1959, pp. 290-297.
21. KREITZ, C., and K. WEIHRAUCH, Theory of representations. Theor. Comp. Science 38 (1985), 35-53.
22. KUSHNER, B. A., Lectures on Constructive Mathematical Analysis. Translations of Mathematical Monographs, vol. 60, Amer. Math. Soc., Providence, RI, 1984.
23. LACOMBE, D., Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I - III. C. R. Acad. Sci., Paris, 240 (1955), 2478-2480, 241 (1955), 13-14, 151-153.
24. LACOMBE, D., Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I - III. C. R. Acad. Sci., Paris, 240 (1955), 2478-2480, 241 (1955), 13-14, 151-153.
25. MALTSEV, A. I., Constructive algebras I. Russian Math. Surveys 16 (1961), 77-129. Also in: The Metamathematics of Algebraic Systems: Collected Papers of A. I. Maltsev 1936-1967 (B. F. WELLS III, ed.), North-Holland Publ. Comp., Amsterdam 1971, pp. 148-212.
26. MALTSEV, A. I., Constructive algebras I. Russian Math. Surveys 16 (1961), 77-129. Also in: The Metamathematics of Algebraic Systems: Collected Papers of A. I. Maltsev 1936-1967 (B. F. WELLS III, ed.), North-Holland Publ. Comp., Amsterdam 1971, pp. 148-212.
27. MARKOV A. A., On the continuity of constructive functions. Uspekhi Mat. Nauk, 9 (1954), 226-230 (in Russian).
28. MOSCHOVAKIS, Y. N., Notation systems and recursive ordered fields. Comp. Math. 17 (1964), 40-71.
29. MOSCHOVAKIS, Y. N., Recursive metric spaces. Fund. Math. 15 (1964), 215-238.
30. MULLER, J.-M., Elementary Functions, Algorithms and Implementation. Birkhäuser, Boston-Basel 1997.
31. POUR-EL, M. B., and J. I. RICHARDS, Computability in Analysis and Physics. Springer-Verlag, Berlin-Heidelberg-New York 1989.
32. ROGERS, H., JR., Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York 1967.
33. STOLTENBERG-HANSEN, V., and J. V. TUCKER, Effective algebras. In: Handbook of Logic in Computer Science (S. ABRAMSKY, D. M. GABBAY, and T. S. E. MAIBAUM, eds.), Vol. IV: Semantic Modelling, University Press, Oxford 1995, pp. 357-526.
34. TSEYTIN, G. S., Algorithmic operators in constructive metric spaces. Amer. Math. Soc. Transl. 2(64), 1967 (Trudy Mat. Inst. Steklov. 67 (1962), 259-361).
35. TSEYTIN, G. S., Algorithmic operators in constructive metric spaces. Amer. Math. Soc. Transl. 2(64), 1967 (Trudy Mat. Inst. Steklov. 67 (1962), 259-361).
36. WEIHRAUCH, K., Type 2 recursion theory. Theor. Comp. Science 38 (1985), 17-33.
37. WEIHRAUCH, K., Computability. Springer-Verlag, Berlin-Heidelberg-New York 1987.
38. WEIHRAUCH, K., Computability on computable metric spaces. Theor. Comp. Science 113 (1993), 191-210.
39. WEIHRAUCH, K., A simple introduction to computable analysis. 2nd ed. Technical Report 171, FernUniversität Hagen, July 1995.
40. WEIHRAUCH, K., A foundation for computable analysis. In: Combinatorics, Complexity, and Logic, Procedings of DMTCS'96, Auckland (D. S. BRIDGES et al., eds.), Springer-Verlag, Singapore 1997, pp. 66-89.
41. WEIHRAUCH, K., and C. KREITZ, Representations of the real numbers and of the open subsets of the real numbers. Annals Pure Appl. Logic 35 (1987), 247-260.