Two characterizations are given of those structural consequence operations on a propositional language which can be defined via proofs from a finite number of polynomial rules.