On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness (1997)
Cached
Download Links
- [www.brics.dk]
- [www.brics.dk]
- [www.brics.dk]
- [www.brics.dk]
- DBLP
Other Repositories/Bibliography
| Venue: | PURE AND APPLIED LOGIC |
| Citations: | 7 - 2 self |
BibTeX
@INPROCEEDINGS{Kohlenbach97onthe,
author = {Ulrich Kohlenbach},
title = {On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness},
booktitle = {PURE AND APPLIED LOGIC},
year = {1997},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 arithmetical principles thereby determining faithfully the arithmetical content of the former. This is achieved using the method of elimination of Skolem functions for monotone formulas which was introduced by the author in a previous paper. As
