A structural rule in sequent calculus formalizations of proof theory according to which the order of instances of formulae appearing in a cedent may be permuted without loss of generality. Where , , , and are sets of formulae and a formula, this inference is represented as left- and right-exchange:
When a sequent calculus admits exchange, cedents may be construed as either multisets or sequences without loss of generality.