Swipe to navigate through the chapters of this book
The objective of this chapter is to explain the structure of mathematical proofs, especially proofs of correctness of algorithms. Boolean operators are defined by their truth tables. The definition of a valid argument form is intuitive and easily confirmed using a truth table. These are followed by many examples of standard and common patterns of proof: direct and indirect arguments, mathematical induction, and strong mathematical induction.
Please log in to get access to this content
- Boolean Expressions, Logic, and Proof
- Springer London
- Sequence number
- Chapter number