Abstract
Extending previous results from work on the complexity of cut elimination for the sequent calculus LK, we discuss the role of quantifier alternations and develop a measure to describe the complexity of cut elimination in terms of quantifier alternations in cut formulas and contractions on such formulas.
Citation
Philipp Gerhardy. "The Role of Quantifier Alternations in Cut Elimination." Notre Dame J. Formal Logic 46 (2) 165 - 171, 2005. https://doi.org/10.1305/ndjfl/1117755147
Information