On the Length of Medial-Switch-Mix Derivations

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10388)

Abstract

Switch and medial are two inference rules that play a central role in many deep inference proof systems. In specific proof systems, the mix rule may also be present. In this paper we show that the maximal length of a derivation using only the inference rules for switch, medial, and mix, modulo associativity and commutativity of the two binary connectives involved, is quadratic in the size of the formula at the conclusion of the derivation. This shows, at the same time, the termination of the rewrite system.

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.University of BathBathUK
  2. 2.InriaPalaiseauFrance

Personalised recommendations