Cut-elimination is a process in proof theory that simplifies sequent calculus proofs by removing unnecessary intermediate assertions, known as 'cuts,' thereby transforming them into cut-free proofs. This process is fundamental for establishing consistency and normalization in logical systems, as it ensures that proofs can be constructed using only the axioms and inference rules of the system.