Strong Normalisation of Cut-Elimination in Classical Logic

Strong Normalisation of Cut-Elimination in Classical Logic (2000)

by C. Urban , G. M. Bierman

Citations:

29 - 4 self

User correction supplied by mph

Datum	Value	Source
TITLE	Strong Normalisation of Cut-Elimination in Classical Logic	user correction - Legacy Corrections
AUTHOR NAME	C. Urban	user correction
AUTHOR NAME	G. M. Bierman	user correction
AUTHOR AFFIL	University of Cambridge,	user correction
AUTHOR ADDR	Cambridge, UK.	user correction
ABSTRACT	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.	user correction
YEAR	2000	user correction - Legacy Corrections
CITATIONS	27 found	ParsCit 1.0