Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T16:37:59.263Z Has data issue: false hasContentIssue false

Sharpened lower bounds for cut elimination

Published online by Cambridge University Press:  12 March 2014

Samuel R. Buss*
Affiliation:
Department of Mathematics, University of California, San Diego, La Jolla, Ca 92093-0112, USA, E-mail: sbuss@math.ucsd.edu

Abstract

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 − O(1). The proof method is based on more efficiently expressing the Gentzen–Solovay cut formulas as low depth formulas.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable