A Formalisation Of Weak Normalisation (With Respect To Permutations) Of Sequent Calculus Proofs (1999)
| Citations: | 3 - 0 self |
BibTeX
@MISC{Adams99aformalisation,
author = {A. A. Adams},
title = {A Formalisation Of Weak Normalisation (With Respect To Permutations) Of Sequent Calculus Proofs},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
rule). This is also the case for NJ and LJ as defined in this formalisation. This is due to the particular nature of the logics in question, and does not necessarily generalise to other logics. In particular, a formalisation of linear logic would not work in this fashion, and a more complex variable-referencing mechanism would be required. See Section 6 for a further discussion of this problem. Other operations, such as substitutions (sub in Table 2) and weakening, require lift and drop operations as defined in [27] to ensure the correctness of the de Bruijn indexing.
