Skip to main content
SpringerLink
Log in

Pointwise hereditary majorization and some applications

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

A pointwise version of the Howard-Bezem notion of hereditary majorization is introduced which has various advantages, and its relation to the usual notion of majorization is discussed. This pointwise majorization of primitive recursive functionals (in the sense of Gödel'sT as well as Kleene/Feferman's

) is applied to systems of intuitionistic and classical arithmetic (H andH c) in all finite types with full induction as well as to the corresponding systems with restricted inductionĤ↾ andĤ↾c.

  1. 1)

    H and Ĥ↾ are closed under a generalized fan-rule. For a restricted class of formulae this also holds forH c andĤ↾c.

  2. 2)

    We give a new and very perspicuous proof that for each

    one can construct a functional

    such that\(\tilde \Phi \alpha \) is a modulus of uniform continuity for Φ on {β1∣∧n(βn≦αn)}. Such a modulus can also be obtained by majorizing any modulus of pointwise continuity for Φ.

  3. 3)

    The type structure ℳ of all pointwise majorizable set-theoretical functionals of finite type is used to give a short proof that quantifier-free “choice” with uniqueness (AC!)1,0-qf. is not provable within classical arithmetic in all finite types plus comprehension [given by the schema (C)ϱ:∨y 0ϱ∧x ϱ(yx=0⇔A(x)) for arbitraryA], dependent ω-choice and bounded choice. Furthermore ℳ separates several μ-operators.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bezem, M.A.: Strongly majorizable functionals of finite type: a model for bar recursion containing discontinuous functionals. J. Symb. Logic50, 652–660 (1985)

    Google Scholar 

  • Bezem, M.A.: Bar recursion and functionals of finite type. Dissertation, Utrecht 1986

  • Feferman, S.: Theories of finite type. In: Barwise, J. (ed.) Handbook of mathematical logic, pp. 913–972. Amsterdam: North-Holland 1977

    Google Scholar 

  • Feferman, S., Levy, A.: Independence results in set theory by Cohen's method II (abstract). Notices Am. Math. Soc.10, 593 (1963)

    Google Scholar 

  • Friedrich, W.: Spielquantorinterpretation unstetiger Funktionale in der höheren Analysis. Arch. Math. Logic24, 73–99 (1984)

    Google Scholar 

  • Friedrich, W.: Gödelsche Funktionalinterpretation für eine Erweiterung der klassischen Analysis. Z. Math. Logik Grundlagen Math.31, 3–29 (1985)

    Google Scholar 

  • Gödel, K.: Über eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes. Dialectica12, 280–287 (1958)

    Google Scholar 

  • Howard, W.A.: Hereditarily majorizable functionals of finite type. In: Troelstra A.S. (ed.) Mathematical investigation of intuitionistic arithmetic and analysis. (Lect. Notes Math., vol. 344, pp. 454–461) Berlin Heidelberg New York: Springer 1973

    Google Scholar 

  • Kleene, S.C.: Recursive functionals and quantifiers of finite types. I. Trans. Am. Math. Soc.91, 1–52 (1959)

    Google Scholar 

  • Kohlenbach, U.: Theorie der majorisierbaren und stetigen Funktionale und ihre Anwendung bei der Extraktion von Schranken aus inkonstruktiven Beweisen: Effektive Eindeutigkeitsmodule bei besten Approximationen aus ineffektiven Eindeutigkeitsbeweisen, pp. xxii + 278. Frankfurt: Dissertation: 1990

  • Kohlenbach, U.: Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization. (A) J. Symb. Logic (to appear)

  • Luckhardt, H.: Extensional Gödel functional interpretation. A consistency proof of classical analysis. Springer (Lect. Notes Math. Vol. 306) Berlin Heidelberg New York: Springer 1973

    Google Scholar 

  • Luckhardt, H.: The real elements in a consistency proof for simple type theory I. In: Diller, J., Müller, G.H. (eds.) Proof theory symposium Kiel 1974. (Lect. Notes Math. Vol. 500, pp. 233–256) Berlin Heidelberg New York: Springer 1975

    Google Scholar 

  • Schwichtenberg, H.: Einige Anwendungen von unendlichen Termen und Wertfunktionalen. Münster: Habilitationsschrift 1973

    Google Scholar 

  • Spector, C.: Provable recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics. In: Dekker, J.C.E. (ed.) Recursive function theory. Proc. Symp. Pure Math. Vol. 5, pp. 1–27, AMS, Providence, R.I. 1962

    Google Scholar 

  • Troelstra, A.S.: Metamathematical investigation of intuitionistic arithmetic and analysis (Lect. Notes Math. Vol. 344) Berlin Heidelberg New York: Springer 1973

    Google Scholar 

  • Troelstra, A.S.: Note on the fan theorem. J. Symb. Logic39, 584–596 (1974)

    Google Scholar 

  • Troelstra, A.S.: Some models for intuitionistic finite type arithmetic with fan functional. J. Symb. Logic42, 194–202 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, J. W. Goethe-Universität, Robert-Mayer-Strasse 6-10, W-6000, Frankfurt am Main, Federal Republic of Germany

    Ulrich Kohlenbach

Authors
  1. Ulrich Kohlenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kohlenbach, U. Pointwise hereditary majorization and some applications. Arch Math Logic 31, 227–241 (1992). https://doi.org/10.1007/BF01794980

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01794980

Keywords

Search

Navigation