64 search results - page 4 / 13 » Cut elimination in coalgebraic logics |
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...
PADL
2004
Springer
13 years 10 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
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...
LFCS
2007
Springer
13 years 11 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
WOLLIC
2009
Springer
13 years 12 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...