Gentzen-like systems for partial propositional calculi. I. II (Q2534156)

These papers present a generalized definition of a Gentzen system (with provable cut-elimination theorem) and then apply this definition to specific classical one-axiom propositional calculi to obtain Gentzen-like systems for these calculi. In one case the method involves replacing the cut-rule with other, simpler rules. In the other cases, Gentzen-like systems are constructed directly without a cut-rule and a method of proving these systems equivalent to the classical ones is given.