A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Modular Cut-Elimination: Finding Proofs or Counterexamples
[chapter]
2006
Lecture Notes in Computer Science
Modular cut-elimination is a particular notion of "cut-elimination in the presence of non-logical axioms" that is preserved under the addition of suitable rules. We introduce syntactic necessary and sufficient conditions for modular cut-elimination for standard calculi, a wide class of (possibly) multipleconclusion sequent calculi with generalized quantifiers. We provide a "universal" modular cut-elimination procedure that works uniformly for any standard calculus satisfying our conditions. The
doi:10.1007/11916277_10
fatcat:zgzezwfyy5fehnhtp2eicts6iy