Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
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 recursiv...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
1998
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/3829 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/3829 |