Proofs in propositional logic are typically presented as trees of derived formulas or, alternatively, directed acyclic graphs formulas. This distinction between tree-like vs. dag-like structure is particularly relevant when making quantitative considerations regarding, for example, proof size. Here we analyze a more general type structural restriction proofs rule-based systems. In this definiti...