Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T05:26:31.970Z Has data issue: false hasContentIssue false

Strong cut-elimination in sequent calculus using Klop's ι-translation and perpetual reductions

Published online by Cambridge University Press:  12 March 2014

Morten Heine Sørensen
Affiliation:
Formalit, Byenden 32, 4660 Store Heddinge, Denmark, E-mail: mhs@formalit.dk
PaweŁ Urzyczyn
Affiliation:
University of Warsaw, Institute of Informatics, Banacha2, 02-097 Warszawa, Poland, E-mail: urzy@mimuw.edu.pl

Abstract

There is a simple technique, due to Dragalin. for proving strong cut-elimination for intuitionistic sequent calculus, but the technique is constrained to certain choices of reduction rules, preventing equally natural alternatives. We consider such a natural, alternative set of reduction rules and show that the classical technique is inapplicable. Instead we develop another approach combining two of our favorite tools—Klop's ι-translation and perpetual reductions.

These tools are of independent interest and have proved useful in a variety of settings; it is therefore natural to investigate, as we do here, what they have to offer the field of sequent calculus.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable