|
| << previous |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 7 of 7 found articles
| Title: |
Strong Normalisation of Cut-Elimination in Classical Logic |
| Author: |
C. Urban G.M. Bierman |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 45 (2003) nr. 1-2 pages 123-155 |
| Year: |
2003-07-11 |
| Contents: |
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen's standard cut-reductions, but is less restrictive than previous strongly normalising cut-elimination procedures. In comparison, for example, with works by Dragalin and Danos et al., our procedure requires no special annotations on formulae and allows cut-rules to pass over other cut-rules. In order to adapt the notion of symmetric reducibility candidates for proving the strong normalisation property, we introduce a novel term assignment for sequent proofs of classical logic and formalise cut-reductions as term rewriting rules. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 7 of 7 found articles
| << previous |