Hostname: page-component-74656f9884-rngvg Total loading time: 0 Render date: 2026-11-06T01:20:40.800Z Has data issue: false hasContentIssue false
  • English
  • Français

Modified bar recursion

Published online by Cambridge University Press:  17 May 2006

ULRICH BERGER  and
PAULO OLIVA
ULRICH BERGER
Affiliation:
Department of Computer Science, University of Wales Swansea, Singleton Park, Swansea, SA2 8PP, United Kingdom
PAULO OLIVA
Affiliation:
Department of Computer Science, Queen Mary, University of London, Mile End Road, London E3 1NS, United Kingdom
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper studies modified bar recursion, a higher type recursion scheme, which has been used in Berardi et al. (1998) and Berger and Oliva (2005) for a realisability interpretation of classical analysis. A complete clarification of its relation to Spector's and Kohlenbach's bar recursion, the fan functional, Gandy's functional $\Gamma$ and Kleene's notion of S1–S9 computability is given.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 16 , Issue 2 , April 2006 , pp. 163 - 183
Copyright
2006 Cambridge University Press