| General Preface | p. xi |
| Preface for Instructors | p. xii |
| |
| Proof Techniques | p. 1 |
| Elements of Logic and Induction | p. 2 |
| Definitions | p. 2 |
| Propositions and Predicates | p. 3 |
| Conjunction and Negation | p. 7 |
| Implication | p. 9 |
| Proofs by Induction for Natural Numbers | p. 12 |
| Methods of Proof | p. 24 |
| Chains of Implications | p. 24 |
| Proof by Contradiction | p. 32 |
| Instantiation | p. 38 |
| Constructive and Non-Constructive Proofs | p. 40 |
| Disproofs | p. 43 |
| Predicate Calculus | p. 45 |
| Logical Operators | p. 46 |
| Propositional Forms | p. 48 |
| Parentheses | p. 50 |
| Standard Logical Identities | p. 53 |
| Standard Rules of Inference | p. 55 |
| Aristotelean Logic | p. 57 |
| Logical Equivalence | p. 62 |
| Commutativity and Associativity | p. 68 |
| Proving Propositional Forms | p. 72 |
| Predicate Forms and Quantification | p. 74 |
| Standard Valid Predicate Forms | p. 80 |
| Proving Predicate Forms | p. 83 |
| Disproofs | p. 86 |
| Set Theory | p. 93 |
| Axioms and the Primitives of Set Theory | p. 94 |
| The Basics of Set Theory | p. 98 |
| ZFC Set Theory | p. 107 |
| Binary Operations on Sets | p. 114 |
| Cartesian Products | p. 122 |
| Absolute Complements and DeMorgan's Laws | p. 127 |
| The Set of Non-Negative Integers | p. 134 |
| Inductive Definitions | p. 141 |
| Sets of Numbers | p. 150 |
| Elementary Number Theory | p. 151 |
| Common Multiples | p. 152 |
| The Division Algorithm | p. 154 |
| Common Divisors | p. 156 |
| Relatively Prime Pairs | p. 157 |
| Linear Diophantine Equations | p. 159 |
| The Fundamental Theorem of Arithmetic | p. 164 |
| The Euclidean Algorithm | p. 168 |
| Continued Fractions | p. 172 |
| Relations | p. 179 |
| N-ary Relations | p. 180 |
| Binary Relations and Digraphs | p. 184 |
| Properties of Relations | p. 189 |
| Set-Theoretic Operations | p. 194 |
| Inversion | p. 196 |
| Composition | p. 198 |
| Iterations | p. 203 |
| Posets | p. 208 |
| Linear and Well Orders | p. 214 |
| Bounds in Posets | p. 222 |
| Axiom of Choice Revisited | p. 225 |
| Equivalence Relations | p. 227 |
| Partitions | p. 234 |
| Closure Operations | p. 241 |
| Meets and Joins of Partitions | p. 249 |
| Lattices | p. 252 |
| Functions | p. 259 |
| Definitions and Examples | p. 260 |
| Composition | p. 269 |
| Restriction and Extension | p. 275 |
| Injectivity, Surjectivity, and Bijectivity | p. 278 |
| Inverses | p. 285 |
| Images and Pre-Images | p. 292 |
| Elements of Dynamical Systems | p. 301 |
| Permutations | p. 307 |
| |
| Cardinality | p. 313 |
| Finite Sets | p. 314 |
| Infinite Sets | p. 319 |
| Countable Sets | p. 322 |
| Uncountable Sets | p. 328 |
| Comparing Cardinalities | p. 332 |
| Elements of Combinatorics | p. 341 |
| Finite Cardinalities | p. 342 |
| Combinatorial Proofs | p. 345 |
| Recursively Defined Sequences | p. 353 |
| Inductive Proofs and Solving Recursions | p. 361 |
| Characteristic Equations | p. 368 |
| Generating Functions | p. 374 |
| Languages and Finite State Automata | p. 383 |
| Alphabets, Words, and Concatenation | p. 384 |
| Languages | p. 388 |
| Regular Expressions | p. 396 |
| Finite State Automata | p. 399 |
| Kleene's Theorem | p. 408 |
| Semigroups and Monoids | p. 417 |
| Graphs | p. 425 |
| Definitions and Examples | p. 426 |
| Trees | p. 432 |
| Hamiltonian and Eulerian Paths | p. 438 |
| Planarity | p. 441 |
| Connectivity, Matching, and Coloring | p. 446 |
| Suggestions for Further Reading | p. 455 |
| Index of Notation | p. 456 |
| Index | p. 459 |
| Table of Contents provided by Syndetics. All Rights Reserved. |