Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Article
  • Cited by 17
  • Cited by
    Crossref Citations
    Crossref logo
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.
    Sanders, Sam 2018. The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis. Computability, Vol. 7, Issue. 1, p. 7.
    RAHLI, VINCENT and BICKFORD, MARK 2018. Validating Brouwer's continuity principle for numbers using named exceptions. Mathematical Structures in Computer Science, Vol. 28, Issue. 06, p. 942.
    Oliva, Paulo and Powell, Thomas 2017. Bar recursion over finite partial functions. Annals of Pure and Applied Logic, Vol. 168, Issue. 5, p. 887.
    ESCARDÓ, MARTÍN and OLIVA, PAULO 2017. THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT. The Journal of Symbolic Logic, Vol. 82, Issue. 02, p. 590.
    Rahli, Vincent Bickford, Mark and Constable, Robert L. 2017. Bar induction: The good, the bad, and the ugly. p. 1.
    Rahli, Vincent and Bickford, Mark 2016. A nominal exploration of intuitionism. p. 130.
    Capretta, Venanzio and Uustalu, Tarmo 2016. Foundations of Software Science and Computation Structures. Vol. 9634, Issue. , p. 91.
    Liefke, Kristina and Sanders, Sam 2016. Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016). Vol. 10054, Issue. , p. 175.
    ESCARDÓ, MARTÍN and OLIVA, PAULO 2015. BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS. The Journal of Symbolic Logic, Vol. 80, Issue. 01, p. 1.
    ESCARDÓ, MARTÍN 2015. Constructive decidability of classical continuity. Mathematical Structures in Computer Science, Vol. 25, Issue. 07, p. 1578.
    Powell, Thomas 2015. Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice. Journal of Logic and Computation,
    Powell, Thomas 2014. The equivalence of bar recursion and open recursion. Annals of Pure and Applied Logic, Vol. 165, Issue. 11, p. 1727.
    Ratiu, D. and Trifonov, T. 2012. Exploring the Computational Content of the Infinite Pigeonhole Principle. Journal of Logic and Computation, Vol. 22, Issue. 2, p. 329.
    Escardo, M. and Oliva, P. 2011. Sequential games and optimal strategies. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 467, Issue. 2130, p. 1519.
    ESCARDÓ, MARTÍN and OLIVA, PAULO 2010. Selection functions, bar recursion and backward induction. Mathematical Structures in Computer Science, Vol. 20, Issue. 02, p. 127.
    Coquand, Thierry 2009. Computer Science Logic. Vol. 5771, Issue. , p. 2.
    Oliva, Paulo 2008. An Analysis of Gödel'sdialecticaInterpretation via Linear Logic. Dialectica, Vol. 62, Issue. 2, p. 269.
    ×

  • Get access
    Add to cart USD35.00
    Check if you have access via personal or institutional login
    Log in Register

Modified bar recursion

  • ULRICH BERGER (a1) and PAULO OLIVA (a2)
Abstract

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.

Copyright
2006 Cambridge University Press
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

CAPTCHA *

Skip to the audio challenge
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Cancel
Confirm
×