AbstractWhen investigating the complexity of cut-elimination in first-order logic, a natural subproblem is the elimination of quantifier-free cuts. So far, the problem has only been considered in the context of general cut-elimination, and the upper bounds that have been obtained are essentially double exponential. In this note, we observe that a method due to Dale Miller can be applied to obtain an exponential upper bound
The size of shortest cut-free proofs of first-order formulas in intuitionistic sequent calculus is k...
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these...
This is the first book on cut-elimination in first-order predicate logic from an algorithmic point o...
AbstractWhen investigating the complexity of cut-elimination in first-order logic, a natural subprob...
AbstractFree-cut elimination allows cut elimination to be carried out in the presence of non-logical...
We present sharpened lower bounds on the size of cut free proofs for first-order logic. Prior lower ...
AbstractThe importance of the structure of cut-formulas with respect to proof length and proof depth...
International audienceWe consider cut-elimination in the sequent calculus for classical first-order ...
Free-cut elimination allows cut elimination to be carried out in the presence of non-logical axioms....
We prove a general form of \u27free-cut elimination\u27 for first-order theories in linear logic, yi...
International audienceWe prove a general form of 'free-cut elimination' for first-order theories in ...
In Schwichtenberg (Studies in logic and the foundations of mathematics, vol 90, Elsevier, pp 867-895...
Recently a new connection between proof theory and formal language theory was introduced. It was sho...
The worst-case complexity of cut elimination in sequent calculi for first order based logics is inve...
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational i...
The size of shortest cut-free proofs of first-order formulas in intuitionistic sequent calculus is k...
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these...
This is the first book on cut-elimination in first-order predicate logic from an algorithmic point o...
AbstractWhen investigating the complexity of cut-elimination in first-order logic, a natural subprob...
AbstractFree-cut elimination allows cut elimination to be carried out in the presence of non-logical...
We present sharpened lower bounds on the size of cut free proofs for first-order logic. Prior lower ...
AbstractThe importance of the structure of cut-formulas with respect to proof length and proof depth...
International audienceWe consider cut-elimination in the sequent calculus for classical first-order ...
Free-cut elimination allows cut elimination to be carried out in the presence of non-logical axioms....
We prove a general form of \u27free-cut elimination\u27 for first-order theories in linear logic, yi...
International audienceWe prove a general form of 'free-cut elimination' for first-order theories in ...
In Schwichtenberg (Studies in logic and the foundations of mathematics, vol 90, Elsevier, pp 867-895...
Recently a new connection between proof theory and formal language theory was introduced. It was sho...
The worst-case complexity of cut elimination in sequent calculi for first order based logics is inve...
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational i...
The size of shortest cut-free proofs of first-order formulas in intuitionistic sequent calculus is k...
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these...
This is the first book on cut-elimination in first-order predicate logic from an algorithmic point o...
DOI
Add to ORKG