Sciweavers

Share
4 search results - page 1 / 1
» Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounde...
Sort
View
CADE
2006
Springer
13 years 9 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
WOLLIC
2009
Springer
13 years 4 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantiļ¬cation. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
APAL
2010
123views more  APAL 2010»
12 years 9 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
LFCS
1992
Springer
13 years 1 months ago
Denotations for Classical Proofs - Preliminary Results
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
Philippe de Groote
books