CIE
2007
Springer
14 years 4 months ago
2007
Springer
We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses globa...
PADL
2004
Springer
14 years 5 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...
TLCA
2005
Springer
14 years 6 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
TLCA
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
TLCA
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding ...
WOLLIC
2009
Springer
14 years 7 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...
CADE
2006
Springer
15 years 26 days 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...