You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
SHARPENED LOWER BOUNDS FOR CUT ELIMINATION
Contributor:
BUSS, SAMUEL R.
Published:
Association for Symbolic Logic, Inc., 2012
Published in:
The Journal of Symbolic Logic, 77 (2012) 2, Seite 656-668
Language:
English
DOI:
10.2178/jsl/1333566644
ISSN:
0022-4812
Origination:
Footnote:
Description:
We present sharpened lower bounds on the size of cut free proofs for first-order logic. Prior lower bounds for eliminating cuts from a proof established superexponential lower bounds as a stack of exponentials, with the height of the stack proportional to the maximum depth d of the formulas in the original proof. Our results remove the constant of proportionality, giving an exponential stack of height equal to d — 0(1). The proof method is based on more efficiently expressing the Gentzen-Solovay cut formulas as low depth formulas.