Computability over the partial continuous functionals

Journal of Symbolic Logic

Volumn 65, Issue 3, 2000, Pages 1133-1142

  Normann, Dag ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034258671     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586691     Document Type: Article

References (18)

1. S. BELLANTONI, Comments on two notions of higher type computability, unpublished notes, 1990.
2. U. BERGER, Totale objekte und mengen in der bereichtheorie, Thesis, München, 1990, in german.
3. _, Total sets and objects in domain theory, Annals of Pure and Applied Logic, vol. 60 (1993), pp. 91-117.
4. YU. L. ERSHOV, Computable functionals of finite type, Algebra and Logic, vol. 11 (1972), pp. 203-277.
5. J. M. E. HYLAND, Filterspaces and continuous functionals, Annals of Mathematical Logic, vol. 16 (1979), pp. 101-143.
6. S.C. KLEENE, Countable functionals, Constructivity in mathematics (A. Heyting, editor), North-Holland, 1959, pp. 81-100.
7. _, Recursive functionals and quantifiers of finite types I, Transactions of the American Mathematical Society, vol. 91 (1959), pp. 1-52.
8. G. KREISEL, Interpretation of analysis by means of functionals of finite type, Constructivity in mathematics (A. Heyting, editor), North-Holland, 1959, pp. 101-128.
9. G. LONGO and E. MOGGI, The hereditarily partial effective functionals and recursion theory in higher types, THIS JOURNAL, vol. 49 (1984), pp. 1319-1332.
10. J. MOLDESTAD, Computation in higher types, Springer Lecture Notes in Mathematics, vol. 574, 1977.
11. D. NORMANN, Nonobtainable continuous functionals, Logic, methodology and philosophy of science VI. Proceedings of the sixth international congress on logic, methodology and philosophy of science (Hannover), 1979, pp. 241-249.
12. _, Recursion on the continuous functionals, Springer Lecture Notes in Mathematics, vol. 811, 1980.
13. _, The continuous functionals; computations, recursions and degrees, Annals of Mathematical Logic, vol. 21 (1981), pp. 1-26.
14. _, The continuous functionals, Handbook of computability theory (E. R. Griffor, editor), Elsevier, 1999, pp. 251-275.
15. G. PLOTKIN, LCF considered as a programming language, Theoretical Computer Science, vol. 5 (1977), pp. 223-255.
16. _, Full abstraction, totality and PCF, Mathematical Structures in Computer Science, vol. 11 (1999), pp. 1-20.
17. V. STOLTENBERG-HANSEN, I. LINDSTRÖM, and E. R. GRIFFOR, Mathematical theory of domains, Cambridge Tracts in Theoretical Computer Science, vol. 22, Cambridge University Press, 1994.
18. W. W. TAIT, Continuity properties of partial recursive functionals of finite type, unpublished notes.