Covers relations, sequences, and posets, emphasizing properties like anti-symmetry and transitivity, and introduces arithmetic and geometric progressions.
Covers the Möbius inversion for posets, defining partially ordered sets and explaining the incidence algebra.
Explores the properties of relations in computer science, including equivalence relations and the partition of a set.
Introduces binary relations, functions, and various types of relations in sets.
Explores entropy theory, compression without loss, and the efficiency of the Shannon-Fano algorithm in data compression.
Covers fundamental concepts related to integers, including properties of well-ordered sets and the principle of induction.
