Elementary Foundations: An Introduction to Topics in Discrete Mathematics (Sylvestre)
- Page ID
- 83395
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)
- Front Matter
- 1: Symbolic language
- 2: Logical equivalence
- 3: Boolean algebra
- 4: Predicate logic
- 5: Arguments
- 6: Definitions and proof methods
- 7: Proof by mathematical induction
- 8: Axiomatic systems
- 9: Sets
- 10: Functions
- 11: Recurrence and induction
- 12: Cardinality
- 13: Countable and uncountable sets
- 14: Graphs
- 15: Paths and connectedness
- 16: Trees and searches
- 17: Relations
- 18: Equivalence relations
- 19: Partially ordered sets
- 20: Counting
- 21: Permutations
- 22: Combinations
- 23: Binomial and multinomial coefficients
- Back Matter
Thumbnail: A Venn diagram illustrating the intersection of two sets. (Public Domain; Cepheus via Wikipedia).