A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
When defined with general elimination/application rules, natural deduction and λ-calculus become closer to sequent calculus. In order to get real isomorphism, normalisation has to be defined in a "multiary" variant, in which reduction rules are necessarily non-local (reason: nomalisation, like cut-elimination, acts at the head of applicative terms, but natural deduction focuses at the tail of such terms). Non-local rules are bad, for instance, for the mechanization of the system. A solution isdoi:10.1007/978-3-540-73001-9_27 fatcat:yike52mbgneqxdfmbnikmo44n4