Publicação
Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
| Resumo: | We describe a sequent calculus, based on work of Herbelin's, of which the cut-free derivations are in 1-1 correspondence with normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin's strong cut-elimination theorem for the calculus, using the recursive path oredering theorem of Dershowitz. |
|---|---|
| Autores principais: | Pinto, Luís F. |
| Outros Autores: | Dyckhoff, Roy |
| Assunto: | Cut-elimination Normalisation Natural deduction Intuitionistic logic Recursive path ordering Termination |
| Ano: | 1998 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | We describe a sequent calculus, based on work of Herbelin's, of which the cut-free derivations are in 1-1 correspondence with normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin's strong cut-elimination theorem for the calculus, using the recursive path oredering theorem of Dershowitz. |
|---|