| |
| |
The Logic of Compound Statements | |
| |
| |
Logical Form and Logical Equivalence | |
| |
| |
Conditional Statements | |
| |
| |
Valid and Invalid Arguments | |
| |
| |
Application: Digital Logic Circuits | |
| |
| |
Application: Number Systems and Circuits for Addition | |
| |
| |
The Logic of Quantified Statements | |
| |
| |
Introduction to Predicates and Quantified Statements I | |
| |
| |
Introduction to Predicates and Quantified Statements II | |
| |
| |
Statements Containing Multiple Quantifiers | |
| |
| |
Arguments with Quantified Statements | |
| |
| |
Elementary Number Theory and Methods of Proof | |
| |
| |
Direct Proof and Counterexample I: Introduction | |
| |
| |
Direct Proof and Counterexample II: Rational Numbers | |
| |
| |
Direct Proof and Counterexample III: Divisibility | |
| |
| |
Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem | |
| |
| |
Direct Proof and Counterexample V: Floor and Ceiling | |
| |
| |
Indirect Argument: Contradiction and Contraposition | |
| |
| |
Two Classical Theorems | |
| |
| |
Application: Algorithms | |
| |
| |
Sequences and Mathematical Induction | |
| |
| |
Sequences | |
| |
| |
Mathematical Induction I | |
| |
| |
Mathematical Induction II | |
| |
| |
Strong Mathematical Induction and the Well-Ordering Principle | |
| |
| |
Application: Correctness of Algorithms | |
| |
| |
Set Theory | |
| |
| |
Basic Definitions of Set Theory | |
| |
| |
Properties of Sets | |
| |
| |
Disproofs, Algebraic Proofs, and Boolean Algebras | |
| |
| |
Russell's Paradox and the Halting Problem | |
| |
| |
Counting and Probability | |
| |
| |
Introduction | |
| |
| |
Possibility Trees and the Multiplication Rule | |
| |
| |
Counting Elements of Disjoint Sets: The Addition Rule | |
| |
| |
Counting Subsets of a Set: Combinations | |
| |
| |
R-Combinations with Repetition Allowed | |
| |
| |
The Algebra of Combinations | |
| |
| |
The Binomial Theorem | |
| |
| |
Probability Axioms and Expected Value | |
| |
| |
Conditional Probability, Bayes' Formula, and Independent Events | |
| |
| |
Functions | |
| |
| |
Functions Defined on General Sets | |
| |
| |
One-to-One and Onto, Inverse Functions | |
| |
| |
Application: The Pigeonhole Principle | |
| |
| |
Composition of Functions | |
| |
| |
Cardinality with Applications to Computability | |
| |
| |
Recursion | |
| |
| |
Recursively Defined Sequences | |
| |
| |
Solving Recurrence Relations by Iteration | |
| |
| |
Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients | |
| |
| |
General Recursive Definitions | |
| |
| |
The Efficiency of Algorithms | |
| |
| |
Real-Valued Functions of a Real Variable and Their Graphs | |
| |
| |
O-, Omega-, and Theta-Notations | |
| |
| |
Application: Efficiency of Algorithms I | |
| |
| |
Exponential and Logarithmic Functions: Graphs and Orders | |
| |
| |
Application: Efficiency of Algorithms II | |
| |
| |
Relations | |
| |
| |
Relations on Sets | |
| |
| |
Reflexivity, Symmetry, and Transitivity | |
| |
| |
Equivalence Relations | |
| |
| |
Modular Arithmetic with Applications to Cryptography | |
| |
| |
Partial Order Relations | |
| |
| |
Graphs and Trees | |
| |
| |
Graphs: An Introduction | |
| |
| |
Paths and Circuits | |
| |
| |
Matrix Representations of Graphs | |
| |
| |
Isomorphisms of Graphs | |
| |
| |
Trees | |
| |
| |
Spanning Trees | |
| |
| |
Finite State Automata and Applications | |
| |
| |
Finite-State Automata | |
| |
| |
Application: Regular Expressions | |
| |
| |
Finite-State Automata | |
| |
| |
Simplifying Finite-State Automata | |
| |
| |
Appendices | |
| |
| |
Properties of the Real Numbers | |
| |
| |
Solutions and Hints to Selected Exercises | |