26 search results - page 2 / 6 » Atomic Cut Elimination for classical Logic |
IANDC
2000
13 years 8 months ago
2000
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
LICS
1995
IEEE
14 years 2 days ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
TLCA
2001
Springer
14 years 29 days 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...
CSL
2009
Springer
14 years 3 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...