Journal of Symbolic Logic

Functional interpretation and inductive definitions

Jeremy Avigad and Henry Towsner

Source: J. Symbolic Logic Volume 74, Issue 4 (2009), 1100-1120.

Abstract

Extending Gödel's Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finite-type functionals defined using transfinite recursion on well-founded trees.

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.jsl/1254748682
Digital Object Identifier: doi:10.2178/jsl/1254748682

References

Peter Aczel, The type theoretic interpretation of constructive set theory, Logic Colloquium '77, North-Holland, Amsterdam, 1978, pp. 55--66.
Mathematical Reviews (MathSciNet): MR519801
Klaus Aehlig, On fragments of analysis with strengths of finitely iterated inductive definitions, Ph.D. thesis, University of Munich, 2003.
Zentralblatt MATH: 1083.03049
Jeremy Avigad, A variant of the double-negation translation, Technical Report CMU-PHIL 179, Carnegie Mellon.
--------, Predicative functionals and an interpretation of $\widehat\rm ID\sb <\omega$, Annals of Pure and Applied Logic, vol. 92 (1998), pp. 1--34.
Mathematical Reviews (MathSciNet): MR1624807
Zentralblatt MATH: 0945.03084
Digital Object Identifier: doi:10.1016/S0168-0072(97)00045-6
--------, Interpreting classical theories in constructive ones, Journal of Symbolic Logic, vol. 65 (2000), pp. 1785--1812.
Mathematical Reviews (MathSciNet): MR1812180
Zentralblatt MATH: 0981.03061
Digital Object Identifier: doi:10.2307/2695075
Jeremy Avigad and Solomon Feferman, Gödel's functional (``Dialectica'') interpretation, Handbook of proof theory, North-Holland, Amsterdam, 1998, pp. 337--405.
Mathematical Reviews (MathSciNet): MR1640329
Digital Object Identifier: doi:10.1016/S0049-237X(98)80020-7
Wilfried Buchholz, The $\Omega_\mu+1$-rule, In Buchholz et al. [buchholz:et:al:81?], pp. 188--233.
--------, Ordinal analysis of $\naID_\nu$, In Buchholz et al. [buchholz:et:al:81?], pp. 234--260.
Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg, Iterated inductive definitions and subsystems of analysis: Recent proof-theoretical studies, Lecture Notes in Mathematics, vol. 897, Springer, Berlin, 1981.
Mathematical Reviews (MathSciNet): MR655036
Zentralblatt MATH: 0489.03022
Wolfgang Burr, A Diller-Nahm-style functional interpretation of $\rm KP\omega$, Archive for Mathematical Logic, vol. 39 (2000), pp. 599--604.
Mathematical Reviews (MathSciNet): MR1797811
Zentralblatt MATH: 0968.03066
Digital Object Identifier: doi:10.1007/s001530050167
J. Diller and W. Nahm, Eine Variante zur Dialectica Interpretation der Heyting-Arithmetik endlicher Typen, Archiv für mathematische Logik und Grundlagenforschung, vol. 16 (1974), pp. 49--66.
Mathematical Reviews (MathSciNet): MR366626
Solomon Feferman, Ordinals associated with theories for one inductively defined set, unpublished paper, 1968.
Fernando Ferreira and Paulo Oliva, Bounded functional interpretation, Annals of Pure and Applied Logic, vol. 135 (2005), pp. 73--112.
Mathematical Reviews (MathSciNet): MR2156133
Digital Object Identifier: doi:10.1016/j.apal.2004.11.001
Harvey M. Friedman, Classically and intuitionistically provable functions, Higher set theory (H. Müller and D. Scott, editors), Lecture Notes in Mathematics, vol. 669, Springer, Berlin, 1978, pp. 21--27.
Kurt Gödel, Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica, vol. 12 (1958), pp. 280--287, reprinted with English translation in [goedel:90?], pp. 241--251.
Mathematical Reviews (MathSciNet): MR102482
Digital Object Identifier: doi:10.1111/j.1746-8361.1958.tb01464.x
--------, Collected works, (Solomon Feferman et al., editors), vol. II, Oxford University Press, New York, 1990.
Mathematical Reviews (MathSciNet): MR1032517
W. A. Howard, Functional interpretation of bar induction by bar recursion, Compositio Mathematica, vol. 20 (1968), pp. 107--124.
Mathematical Reviews (MathSciNet): MR230619
Zentralblatt MATH: 0162.31503
--------, A system of abstract constructive ordinals, Journal of Symbolic Logic, vol. 37 (1972), pp. 355--374.
Mathematical Reviews (MathSciNet): MR329869
Zentralblatt MATH: 0264.02026
Digital Object Identifier: doi:10.2307/2272979
Gerhard Jäger, Theories for admissible sets: A unifying approach to proof theory, Bibliopolis, Napoli, 1986.
Mathematical Reviews (MathSciNet): MR881218
S. C. Kleene, Arithmetical predicates and function quantifiers, Transactions of the American Mathematical Society, vol. 79 (1955), pp. 312--340.
Mathematical Reviews (MathSciNet): MR70594
Zentralblatt MATH: 0066.25703
Digital Object Identifier: doi:10.2307/1993033
--------, Hierarchies of number-theoretic predicates, Bulletin of the American Mathematical Society, vol. 61 (1955), pp. 193--213.
Mathematical Reviews (MathSciNet): MR70593
Digital Object Identifier: doi:10.1090/S0002-9904-1955-09896-3
Project Euclid: euclid.bams/1183519724
Ulrich Kohlenbach, Some logical metatheorems with applications in functional analysis, Transactions of the American Mathematical Society, vol. 357 (2005), pp. 89--128.
Mathematical Reviews (MathSciNet): MR2098088
Zentralblatt MATH: 1079.03046
Digital Object Identifier: doi:10.1090/S0002-9947-04-03515-9
--------, Applied proof theory: Proof interpretations and their use in mathematics, Springer,to appear.
Mathematical Reviews (MathSciNet): MR2445721
Zentralblatt MATH: 1158.03002
Ulrich Kohlenbach and Paulo Oliva, Proof mining: a systematic way of analyzing proofs in mathematics, Trudy Matematicheskogo Instituta Imeni V. A. Steklova, vol. 242 (2003), pp. 147--175, (Mat. Logika i Algebra).
Mathematical Reviews (MathSciNet): MR2054493
Georg Kreisel, Generalized inductive definitions, Stanford Report on the Foundations of Analysis (mimeographed), 1963.
Wolfram Pohlers, An upper bound for the provability of transfinite induction in systems with $N$-times iterated inductive definitions, ISILC proof theory symposion, Lecture Notes in Mathematics, vol. 500, Springer, Berlin, 1975, pp. 271--289.
Mathematical Reviews (MathSciNet): MR416865
Zentralblatt MATH: 0351.02026
--------, Proof theoretical analysis of $\naID_\nu$ by the method of local predicativity, In Buchholz et al. [buchholz:et:al:81?], pp. 261--357.
Helmut Schwichtenberg, Proof theory: Some aspects of cut-elimination, Handbook of mathematical logic (Jon Barwise, editor), North-Holland, Amsterdam, 1977, pp. 867--895.
Mathematical Reviews (MathSciNet): MR491063
Joseph R. Shoenfield, Mathematical logic, Association for Symbolic Logic, Urbana, IL, 2001, reprint of the 1973 second printing.
Mathematical Reviews (MathSciNet): MR1809685
Wilfried Sieg, Trees in metamathematics: theories of inductive definitions and subsystems of analysis, Ph.D. thesis, Stanford University.
--------, Inductive definitions, constructive ordinals, and normal derivations, In Buchholz et al. [buchholz:et:al:81?], pp. 143--187.
Martin Stein, Interpretationen der Heyting-Arithmetik endlicher Typen, Archiv für mathematische Logik und Grundlagenforschung, vol. 19 (1978), pp. 175--189.
Mathematical Reviews (MathSciNet): MR539871
Thomas Streicher and Ulrich Kohlenbach, Shoenfield is Gödel after Krivine, Mathematical Logic Quarterly, vol. 53 (2007), pp. 176--179.
Mathematical Reviews (MathSciNet): MR2308497
Digital Object Identifier: doi:10.1002/malq.200610038
William Tait, Applications of the cut elimination theorem to some subsystems of classical analysis, Intuition and proof theory (A. Kino, J. Myhill, and R. E. Vesley, editors), North-Holland, Amsterdam, 1970, pp. 475--488.
Mathematical Reviews (MathSciNet): MR289271
Zentralblatt MATH: 0231.02033
Digital Object Identifier: doi:10.1016/S0049-237X(08)70772-9
A. S. Troelstra, Introductory note to 1958 and 1972, In Feferman et al. [goedel:90?], pp. 217--241.
J. I. Zucker, Iterated inductive definitions, trees, and ordinals, Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer, Berlin, 1973, pp. 392--453.
Mathematical Reviews (MathSciNet): MR444443
Digital Object Identifier: doi:10.1007/BFb0066745

2009 © Association for Symbolic Logic