Bar recursion and products of selection functions

Journal of Symbolic Logic 80 (1):1-28 (2015)
  Copy   BIBTEX

Abstract

We show how two iterated products of selection functions can both be used in conjunction with systemTto interpret, via the dialectica interpretation and modified realizability, full classical analysis. We also show that one iterated product is equivalent over systemTto Spector’s bar recursion, whereas the other isT-equivalent to modified bar recursion. Modified bar recursion itself is shown to arise directly from the iteration of a different binary product of ‘skewed’ selection functions. Iterations of the dependent binary products are also considered but in all cases are shown to beT-equivalent to the iteration of the simple products.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On Spector's bar recursion.Paulo Oliva & Thomas Powell - 2012 - Mathematical Logic Quarterly 58 (4-5):356-265.
The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
Bar recursion over finite partial functions.Paulo Oliva & Thomas Powell - 2017 - Annals of Pure and Applied Logic 168 (5):887-921.
Ordinal analysis of simple cases of bar recursion.W. A. Howard - 1981 - Journal of Symbolic Logic 46 (1):17-30.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
On bar recursion of types 0 and 1.Helmut Schwichtenberg - 1979 - Journal of Symbolic Logic 44 (3):325-329.

Analytics

Added to PP
2016-06-30

Downloads
36 (#618,922)

6 months
10 (#381,237)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bar recursion over finite partial functions.Paulo Oliva & Thomas Powell - 2017 - Annals of Pure and Applied Logic 168 (5):887-921.

Add more citations

References found in this work

On Spector's bar recursion.Paulo Oliva & Thomas Powell - 2012 - Mathematical Logic Quarterly 58 (4-5):356-265.
The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.

Add more references