We finish the proof of equivalence between the sequent calculus and
natural deduction, as far as provability is concerned. Secondly, we
discuss the proof of cut-elimination for the sequent calculus, which is
the major meta-theoretical result justifying present automated theorem
proving techniques and logic programming languages.