The role of quantifier alternations in cut elimination

Notre Dame Journal of Formal Logic

Volumn 46, Issue 2, 2005, Pages 165-171

  Gerhardy, Philipp ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Cut elimination; Proof complexity; Quantifier alternations

Indexed keywords

EID: 35348986261     PISSN: 00294527     EISSN: None     Source Type: Journal    
DOI: 10.1305/ndjfl/1117755147     Document Type: Article

References (5)

1. Gerhardy, P., "Improved Complexity Analysis of Cut Elimination and Herbrand's Theorem," Master's thesis, Aarhus, 2003. 165
2. Gerhardy, P., "Refined complexity analysis of cut elimination," pp. 212-25 in Proceed- ings of the 17th International Workshop CSL 2003, edited by M. Baaz and J. Makovsky, vol. 2803 of LNCS, Springer-Verlag, Berlin, 2003. 165, 166, 167, 168, 169
3. Visser, A., "The unprovability of small inconsistency. A study of local and global interpretability," Archive forMathematical Logic, vol. 32 (1993), pp. 275-98. Zbl 0795.03080. MR 94c:03073. 165, 169, 170
4. Zhang, W., "Cut elimination and automatic proof procedures," Theoretical Computer Science, vol. 91 (1991), pp. 265-84. Zbl 0745.68098. MR 93a:03064. 165, 166
5. Zhang, W., "Depth of proofs, depth of cut-formulas and complexity of cut formulas," Theoretical Computer Science, vol. 129 (1994), pp. 193-206. Zbl 0807.03038. MR 95h:03126. 165, 167, 169