Open Access
2005 The Role of Quantifier Alternations in Cut Elimination
Philipp Gerhardy
Notre Dame J. Formal Logic 46(2): 165-171 (2005). DOI: 10.1305/ndjfl/1117755147

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

Download 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

Published: 2005
First available in Project Euclid: 2 June 2005

zbMATH: 1078.03045
MathSciNet: MR2150949
Digital Object Identifier: 10.1305/ndjfl/1117755147

Subjects:
Primary: 03F05 , 03F20

Keywords: cut elimination , Proof complexity , quantifier alternations

Rights: Copyright © 2005 University of Notre Dame

Vol.46 • No. 2 • 2005
Back to Top