This book deals with the presentation and systematic design of mathematical proofs, including correctness proofs of algorithms. Its purpose is to show how completeness of argument, an important constraint especially for the correctness of algorithms, can be combined with brevity. The author stresses that the use of formalism is indispensible for achieving this. A second purpose of the book is to discuss matters of design. Rather than addressing psychological questions, the author deals with more technical questions like how analysis of the shape of the demonstrandum can guide the design of a proof. This technical rather than psychological view of heuristics together with the stress on exploiting formalism effectively are two key features of the book. The book consists of two independently readable parts. One part includes a number of general chapters discussing techniques for clear exposition, the use of formalism, the choice of notations, the choice of what to name and how to name it, and so on. The other part consists of a series of expositional essays, each dealing with a proof or an algorithm and illustrating the use of techniques discussed in the more general chapters.

A termination argument.- A problem on bichrome 6-graphs.- Proving the existence of the Euler line.- In adherence to symmetry.- On a proof by Arbib, Kfoury, and Moll.- Not about open and closed sets.- A monotonicity argument.- On the inverse of a function.- A calculational proof of Helly's theorem on convex figures.- The formal derivation of a proof of the invariance theorem.- Proving theorems with Euclid's algorithm.- On the deisng of an in-situ permutation algorithm.- Shiloach's algorithm.- Clarity of exposition.- On naming.- On the ue of formalism.- Epilogue.- Proof rules for guarded-command programs.- Notational conventions.