U. Kohlenbach  Home/Search
Context Related
| brics.dk/RS/97/Ref...ICSRS9723.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/RS/97/Ref/BRICSRS97... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems T n in all finite types which are suited to formalize substantial parts of analysis but nevertheless have provably recursive function(al)s of low growth. We reduce the use of instances of these principles in T n -proofs of a large class of formulas to the use of instances of certain ... (Update)
Context of citations to this paper: More
.... principle in [26] via an elimination technique of Skolem functions yielded also new conservation results for comprehension principles ([27]) However, there are also important di#erences due to the di#erent points emphasized in 1) and 2) Whereas there are hardly...
...be done in (a conservative extension of) PRA resp. in PRA 0 2 IA In this section we draw some consequences of our results from [12] and [13] and formulate them in a way which ts into the present framework. Theorem 3.1 Every 0 3 theorem of PRA 2 AC 0;0 qf WKL PCM BW A...
Cited by: More
Things that can and things that can't be done in PRA - Kohlenbach (1998) (Correct)
Foundational and Mathematical Uses of Higher Types - Kohlenbach (1999) (Correct)
Similar documents (at the sentence level):
32.5%: On the Arithmetical Content of Restricted Forms of.. - Kohlenbach (1998) (Correct)
Active bibliography (related documents): More All
1.0: Arithmetizing Proofs in Analysis - Kohlenbach (Correct)
1.0: Proof Interpretations and the Computational Content of Proofs - Kohlenbach (2002) (Correct)
0.6: The Use of a Logical Principle of Uniform Boundedness in Analysis - Kohlenbach (1996) (Correct)
Similar documents based on text: More All
1.2: A Simple Take on Typed Abstract Syntax in Haskell-like Languages - Danvy, Rhiger (2000) (Correct)
1.2: A Unifying Approach to Goal-Directed Evaluation - Danvy, Grobauer, Rhiger (2001) (Correct)
1.2: Normalization by Evaluation with Typed Abstract Syntax - Danvy, Rhiger, Rose (2001) (Correct)
Related documents from co-citation: More All
5: Partial realizations of Hilbert's program (context) - Simpson - 1988
5: Journal of Philosophy (context) - Tait - 1981
5: Studies in Logic and the Foundations of Mathematics Vol (context) - Buss - 1998
BibTeX entry: (Update)
Kohlenbach, U., On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness. Ann. Pure and Applied Logic 95, pp. 257--285 (1998). http://citeseer.ist.psu.edu/kohlenbach97arithmetical.html More
@article{ kohlenbach98arithmetical,
author = "Ulrich Kohlenbach",
title = "On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness",
journal = "Annals of Pure and Applied Logic",
volume = "95",
number = "1-3",
pages = "257-285",
year = "1998",
url = "citeseer.ist.psu.edu/kohlenbach97arithmetical.html" }
Citations (may not include all citations):181 Mathematical Logic (context) - Shoenfield - 1967
104 Metamathematical investigation of intuitionistic arithmetic .. (context) - Troelstra
44 Uber eine bisher noch nicht benutzte Erweiterung des finiten.. (context) - Godel - 1958
20 a number theoretic choice schema and its relation to inducti.. (context) - Parsons - 1970
20 Mathematically strong subsystems of analysis with low rate o.. - Kohlenbach - 1996
18 Fragments of arithmetic (context) - Sieg - 1985
18 Provably recursive functionals of analysis: a consistency pr.. (context) - Spector - 1962
16 Analysing proofs in analysis (context) - Kohlenbach
16 Hereditarily majorizable functionals of finite type (context) - Howard - 1973
14 Arithmetizing proofs in analysis - Kohlenbach
14 Pointwise hereditary majorization and some applications - Kohlenbach - 1992
13 Real growth in standard parts of analysis (context) - Kohlenbach - 1995
13 Zur intuitionistischen Arithmetik und Zahlentheorie (context) - Godel - 1933
12 Extensional Godel functional interpretation (context) - Luckhardt - 1973
12 Strongly majorizable functionals of finite type: a model for.. (context) - Bezem - 1985
8 Elimination of Skolem functions for monotone formulas - Kohlenbach
7 Which set existence axiom are needed to prove CauchyPeano th.. (context) - set, are et al. - 1984
6 a logical principle of uniform boundedness in analysis. To a.. (context) - Kohlenbach - 1995
6 quantifier induction (context) - Parsons - 1972
4 On some formalized conservation results in arithmetic (context) - Clote, H'ajek et al. - 1990
4 A proof-theoretic analysis of collection (context) - Beklemishev - 1996
4 collection schema in arithmetic (context) - Paris, Kirby et al. - 1978
2 Models of Peano Arithmetic (context) - Kay - 1991
2 A note on the \Pi 2 -induction rule (context) - Kohlenbach - 1995
Documents on the same site (http://www.brics.dk/RS/97/Ref/BRICS-RS-97-Ref/): More
Transforming Recursive Equations into Programs with Block.. - Danvy, Schultz (1997) (Correct)
CoFI: The Common Framework Initiative for Algebraic Specification .. - Mosses (1997) (Correct)
Syntax and Semantics of the logic ... - Butz (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC