First at all, I am new at proof theory, so excuse this perhaps redundant question.
I am wondering what is the 'most appropriate' definition of a proof in a sequent calculus (e.g. LK). Proofs as trees or proofs as sequences of sequents?
Does one of the representations have advantages in proofs about the calculus (I am especially thinking of induction on proof length, etc.)?