Hostname: page-component-89b8bd64d-r6c6k Total loading time: 0 Render date: 2026-05-08T21:05:07.406Z Has data issue: false hasContentIssue false
  • English
  • Français

The bounded functional interpretation of the double negation shift

Published online by Cambridge University Press:  12 March 2014

Engrácia Patrícia  and
Fernando Ferreira
Engrácia Patrícia
Affiliation:
Departamento De Matemática, Universidade De Lisboa, Lisboa, Portugal. E-mail: p.engracia@gmail.com
Fernando Ferreira
Affiliation:
Departamento De Matemática, Universidade De Lisboa, Lisboa, Portugal. E-mail: ferferr@cii.fc.ul.pt
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functional of finite type. As an application, we show that full numerical comprehension is compatible with the uniformities introduced by the characteristic principles of the bounded functional interpretation for the classical case.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 75 , Issue 2 , June 2010 , pp. 759 - 773
Copyright
Copyright © Association for Symbolic Logic 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[1]Avigad, J. and Feferman, S., Gödel's functional (“Dialectica”) interpretation, Handbook of proof theory (Buss, S. R., editor), Studies in Logic and the Foundations of Mathematics, vol. 137, North Holland, Amsterdam, 1998, pp. 337–405.CrossRefGoogle Scholar
[2]Bezem, M., Strongly majorizable functionals of finite type: a model for bar recursion containing discontinuous functionals, this Journal, vol. 50 (1985), pp. 652–660.Google Scholar
[3]Ferreira, F., A most artistic package of a jumble of ideas, dialectica, vol. 62 (2008), pp. 205–222, Special Issue: Gödel's dialectica Interpretation. Guest editor: Strahm, Thomas.Google Scholar
[4]Ferreira, F., Injecting uniformities into Peano arithmetic. Annals of Pure and Applied Logic, vol. 157 (2009), pp. 122–129, Special Issue: Kurt Gödel Centenary Research Prize Fellowships. Editors: Artemov, Sergei, Baaz, Matthias and Friedman, Harvey.Google Scholar
[5]Ferreira, F. and Oliva, P., Bounded functional interpretation, Annals of Pure and Applied Logic, vol. 135 (2005), pp. 73–112.CrossRefGoogle Scholar
[6]Gaspar, J., Factorization of the Shoenfield-like bounded functional interpretation, Notre Dame Journal of Formal Logic, vol. 50 (2009), pp. 53–60.CrossRefGoogle Scholar
[7]Gödel, K., Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, dialectica, vol. 12 (1958), pp. 280–287, Reprinted with an English translation in [8].CrossRefGoogle Scholar
[8]Gödel, K., Collected works, vol. II, Feferman, S.et al., eds. Oxford University Press, Oxford, 1990.Google Scholar
[9]Howard, W. A., Functional interpretation of bar induction by bar recursion, Compositio Mathematica, vol. 20 (1968), pp. 107–124.Google Scholar
[10]Howard, W. A., Hereditarily majorizable functionals of finite type, Metamathematical investigation of intuitionistic Arithmetic and Analysis (Troelstra, A. S., editor), Lecture Notes in Mathematics, vol. 344, Springer, Berlin, 1973, pp. 454–461.Google Scholar
[11]Kohlenbach, U., Analysing proofs in analysis, Logic: from foundations to applications (Hodges, W., Hyland, M., Steinhorn, C., and Truss, J., editors), European Logic Colloquium (Keele, 1993), Oxford University Press, 1996, pp. 225–260.CrossRefGoogle Scholar
[12]Kohlenbach, U., Applied proof theory: Proof interpretations and their use in mathematics, Springer Monographs in Mathematics, Springer, Berlin, 2008.Google Scholar
[13]Oliva, P., Understanding and using Spector's bar recursive interpretation of classical analysis, Logical approaches to computational barriers (Löwe, B.Beckmann, A., Berger, U. and Tucker, J., editors), Lecture Notes in Computer Science, vol. 3988, Springer, New York, 2006, pp. 423–434.CrossRefGoogle Scholar
[14]Spector, C., Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics, Recursive function theory (Dekker, F. D. E., editor), American Mathematical Society, Providence, Rhode Island, 1962, pp. 1–27.Google Scholar