3690 search results - page 10 / 738 » Computation with classical sequents |
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
140
click to vote
TLCA
2005
Springer
15 years 9 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 ...
121
Voted
WOLLIC
2009
Springer
15 years 10 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...
134
click to vote
TLCA
2007
Springer
15 years 10 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 ...
112
click to vote
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...