8 search results - page 1 / 2 » Strong Normalisation of Cut-Elimination in Classical Logic |
TLCA
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
TLCA
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
CSL
2003
Springer
13 years 10 months ago
2003
Springer
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
CSR
2008
Springer
13 years 5 months ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...