Abstract
On avoiding avoidable case analyses
Since brevity is an essential virtue of proofs and programs (and will always be so) and case analyses tend to lengthen them, avoiding case analysis is (and will remain) a central issue in mathematical methodology and the methodology of programming. With a series of small examples we’ll illustrate various techniques for case analysis reduction. They should make us understand why counting arguments can be so effective and why they are applicable.
