A relation $\Gamma \vdash \Delta$ between sets of formulas, read as "if every member of $\Gamma$
holds then some member of $\Delta$ does", may obey the three structural rules of Scott 1974:
it is monotone when it survives added premises and conclusions, reflexive when each formula
yields itself, and transitive when it is closed under cut. A monotone reflexive
relation holds between overlapping sets. A transitive one admits cut on a single
formula, and if also monotone it passes through sets of intermediate
conclusions, so that its restriction to single formulas is transitive in
the ordinary sense.
Implementation notes
For a relation r between sets of formulas, monotonicity is Monotone (Function.uncurry r)
and reflexivity is Std.Refl fun φ ψ ↦ r {φ} {ψ}. Transitivity is the cut for sets of
Shoesmith & Smiley 1978, which quantifies over the partitions of a set Z of cut formulas; a
partition is given by its first block Z₁ ⊆ Z, the second being Z \ Z₁. Transitivity of r as
a binary relation on sets would be a different rule, since a set is read conjunctively as premises
and disjunctively as conclusions.
References