This third edition offers an introduction to discrete mathematics, covering relations, induction, counting techniques, logic and graphs. More advanced topics of Boolean algebra and permutation groups are included, and there are numerous examples to reinforce the material.
What people are saying - Write a review
We haven't found any reviews in the usual places.
SETS SEQUENCES AND FUNCTIONS
9 other sections not shown
Other editions - View all
acyclic digraph binary tree Boolean algebra Boolean expression Boolean function Calculate called colors compound proposition compute connected Consider contains cosets countable cycle defined digraph DIJKSTRA'S algorithm disjoint elements equivalence relation exactly example fact false Figure 1(b give given graph G graph in Figure group G Hasse diagram Hence homomorphism implies infinite input integers inverse isomorphic log2 logically equivalent loop invariant maps marbles Mathematical Induction matrix minimum spanning tree minterm multiple nonempty notation obtain orbits output parallel edges partial order partition paths of length permutation poset predicate Principle probability proof propositional calculus Prove random variable real numbers recursive definition Repeat Exercise rooted tree rule semigroup Show smallest sorted labeling subgroup subset Suppose tautology Theorem tion tossed true truth table truth values verify vertex vertex sequence vertices weight write xy'z