In proof theory, a rule of inference that neither introduces nor eliminates a logical connective or operator. Rather, structural rules license the manipulation of cedents by means of removing, adding, or rearranging formulae in a cedent under certain conditions. Logics with corresponding sequent calculi that omit one or more of the classical structural rules are known as substructural logics.