Access the full text.
Sign up today, get DeepDyve free for 14 days.
U. Kohlenbach (1998)
Arithmetizing proofs in analysis
U. Kohlenbach (1995)
A note on theΠ20-induction ruleArchive for Mathematical Logic, 34
W. Sieg (1985)
Fragments of arithmeticAnn. Pure Appl. Log., 28
(1995)
Real growth in standard parts of analysis. Habilitationsschrift, xv+166 pp
S. Kleene (1959)
Recursive functionals and quantifiers of finite types. IITransactions of the American Mathematical Society, 108
(1933)
Zur intuitionistischen Arithmetik und Zahlentheorie
U. Kohlenbach (1992)
Remarks on Herbrand normal forms and Herbrand realizationsArchive for Mathematical Logic, 31
R. Vesley (1967)
Review: Clifford Spector, Provably Recursive Functionals of Analysis: A Consistency Proof of Analysis by an Extension of Principles Formulated in Current Intuitionistic Mathematics
S. Feferman (1977)
Theories of Finite Type Related to Mathematical PracticeStudies in logic and the foundations of mathematics, 90
(1971)
Proof-theoretic analysis of restricted induction schemata (abstract)
A. Nerode (1962)
Review: S. C. Kleene, Recursive Functionals and Quantifiers of Finite Types IJournal of Symbolic Logic, 27
(1976)
Systems of second order arithmetic with restricted induction (abstract)
S. Kleene (1991)
Recursive functionals and quantifiers of finite types revisited. VTransactions of the American Mathematical Society, 325
U. Kohlenbach (1992)
Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorizationJournal of Symbolic Logic, 57
S. Kleene, M. Beeson (1952)
Introduction to Metamathematics
Ulrich Kohlenbach
C. Parsons (1970)
On a Number Theoretic Choice Schema and its Relation to InductionStudies in logic and the foundations of mathematics, 60
V. Gödel (1958)
ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTESDialectica, 12
C. Spector (1962)
Provably recursive functionals of analysis: a consistency proof of analysis by an extension of princ
U. Kohlenbach (1996)
Analysing proofs in analysis
G. Mints (1980)
What can be done with PRA?Journal of Soviet Mathematics, 14
H. Luckhardt (1973)
Extensional Godel functional interpretation;: A consistency proof of classical analysis
U. Kohlenbach (1996)
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionalsArchive for Mathematical Logic, 36
(1985)
Proc. Symposia Pure Math. 42
U. Kohlenbach (1992)
Pointwise hereditary majorization and some applicationsArchive for Mathematical Logic, 31
In this paper a new method, elimination of Skolem functions for monotone formulas, is developed which makes it possible to determine precisely the arithmetical strength of instances of various non-constructive function existence principles. This is achieved by reducing the use of such instances in a given proof to instances of certain arithmetical principles. Our framework are systems ${\cal T}^{\omega} :={\rm G}_n{\rm A}^{\omega} +{\rm AC}$ -qf $+\Delta$ , where (G $_n$ A $^{\omega})_{n \in {\Bbb N}}$ is a hierarchy of (weak) subsystems of arithmetic in all finite types (introduced in [14]), AC-qf is the schema of quantifier-free choice in all types and $\Delta$ is a set of certain analytical principles which e.g. includes the binary König's lemma. We apply this method to show that the arithmetical closures of single instances of $\Pi^0_1$ -comprehension and -choice contribute to the growth of extractable bounds from proofs relative to ${\cal T}^\omega$ only by a primitive recursive functional in the sense of Kleene. In subsequent papers these results are widely generalized and the method is used to determine the arithmetical content of single sequences of instances of the Bolzano-Weierstraß principle for bounded sequences in ${\Bbb R}^d$ , the Ascoli-lemma and others.
Archive for Mathematical Logic – Springer Journals
Published: Jul 1, 1998
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.