Skip to main content
\(\newcommand{\R}{\mathbb{R}} \newcommand{\Z}{\mathbb{Z}} \newcommand{\Pow}{\mathcal{P}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \)
Discrete Mathematics for Computer Science
Mark A. Fitch
Contents
Prev
Up
Next
Contents
Prev
Up
Next
Front Matter
Colophon
About Mark A. Fitch
Preface
1
Basics
Terminology
Sets
Set Operations
Sets in Relational Database
Combinatorics: First Counts
Sorting: Part 0
2
Logic
Formal Logic
Circuits
Predicate Logic
Mathematical Proof
3
Functions
Functions
Boolean Algebra
Modulo Arithmetic
Combinatorics: Second Counts
Proof by Contradiction
4
Relations
Example: Error Correcting Codes
Mathematical Relations
Equivalence Relations
Partially Ordered Sets
Combinatorics: Inclusion/Exclusion
5
Graph Theory
Discovering Graphs
Properties of Graphs
Graph Isomorphism
Paths
Cycles
Trees
Linear Recurrence Relations
Back Matter
A
University Database Example
B
Glossary
Authored in PreTeXt
Author Biography
About Mark A. Fitch
Do you really want to know anything?
