Strong normalisation of cut-elimination in clasical logic

• Autorzy: Urban C. , Bierman G.M.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

classical logic; cut elimination; strong normalisation; symmetric

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2001
• Tom: Vol. 45, nr 1,2
• Strony: 123--155
• Opis fizyczny: bibliogr. 27 poz.

Twórcy

autor

Urban C.

autor

Bierman G.M.

• Institut de Mathematiques de Luminy, CNRS Marseille, Marseille, France,