Modified bar recursion

Mathematical Structures in Computer Science

Volumn 16, Issue 2, 2006, Pages 163-183

  Berger, Ulrich ^a   Oliva, Paulo ^b  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750713660     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005093     Document Type: Conference Paper

References (19)

1. Berardi, S., Bezem, M. and Coquand, T. (1998) On the computational content of the axiom of choice. Journal of Symbolic Logic 63 (2) 600-622.
2. Berger, U. (1990) Totale Objekte und Mengen in der Bereichstheorie, Ph.D. thesis, Mathematisches Institut der Universität München.
3. Berger, U. (2005) Strong normalization for applied lambda calculi. Submitted to Logical Methods in Computer Science, January 2005.
4. Berger, U. and Oliva, P. (2005) Modified bar recursion and classical dependent choice. Springer-Verlag Lecture Notes in Logic 20 89-107.
5. Bezem, M. (1985) Strongly majorizable functionals of finite type: a model for bar recursion containing discontinuous functionals. The Journal of Symbolic Logic 50 652-660.
6. Ershov, Y.L. (1977) Model C of partial continuous functionals. In: Gandy, R. and Hyland, M. (eds.) Logic Colloquium 1976, North Holland 455-467.
7. Gandy, R. O. and Hyland, M. (1977) Computable and recursively countable functionals of higher type. In: Gandy, R. and Hyland, M. (eds.) Logic Colloquium 1976, North Holland 407-438.
8. Gödel, K. (1958) Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12 280-287 1958.
9. Howard, W. A. (1973) Hereditarily majorizable functionals of finite type. In: Troelstra, A. S. (ed.) Metamathematical investigation of intuitionistic Arithmetic and Analysis. Springer-Verlag Lecture Notes in Mathematics 344 454-461.
10. Howard, W. A. and Kreisel, G. (1966) Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis. The Journal of Symbolic Logic 31 325-358.
11. Hyland, F. M. E. (1975) Recursion on the countable functionals, Ph.D. thesis, Oxford.
12. Kleene, S. C. (1959) Countable functionals. In: Heyting, A. (ed.) Constructivity in Mathematics, North Holland 81-100.
13. Kohlenbach, U. (1990) Theory of majorizable and continuous functionals and their use for the extraction of bounds from non-constructive proofs: effective moduli of uniqueness for best approximations from ineffective proofs of uniqueness, Ph.D. thesis (in German), Frankfurt, pages xxii+278.
14. Kreisel, G. (1959) Interpretation of analysis by means of constructive functionals of finite types. In: Heyting, A. (ed.) Constructivity in Mathematics, North Holland 101-128.
15. Normann, D. (1999) The continuous functionals. In: Griffor, E. R. (ed.) Handbook of Computability Theory, Chapter 8, North Holland 251-275.
16. Plotkin, G. D. (1977) LCF considered as a programming language. Theoretical Computer Science 5 223-255.
17. Scott, D.S. (1970) Outline of a mathematical theory of computation. In: 4th Annual Princeton Conference on Information Sciences and Systems 169-176.
18. Spector, C. (1962) Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics. In: Dekker, F. D. E. (ed.) Recursive Function Theory: Proc. Symposia in Pure Mathematics, American Mathematical Society 5 1-27.
19. Troelstra, A. S. (ed.) (1973) Metamathematical Investigation of Intuitionistic Arithmetic and Analysis. Springer-Verlag Lecture Notes in Mathematics 344.