Difference between revisions of "MATxxx"
Jump to navigation
Jump to search
Jose.iovino (talk | contribs) (Created page with "1. Propositional logic: Axioms and Rules of Inference. Boolean Algebras. Limitations of propositional logic: Informal introduction to quantifiers and syllogisms. 2. Predicate...") |
Jose.iovino (talk | contribs) |
||
Line 1: | Line 1: | ||
− | 1 | + | (1) Relations: Cartesian products, relations, properties of relations, equivalence relations and partitions. (2) Order relations: Partially ordered sets, totally ordered sets, extreme elements (maximum, minimum, maximal and minimal elements), well-ordered sets, maximality principles, Zorn's Lemma, lattices, boolean algebras, circuit design. (3) Graphs: Euler and Hamiltonian paths and circuits, matching, graph coloring, Ramsey’s theorem, trees and searching. (4) Binary operations: Groups and semigroups, products and quotients of groups, other algebraic structures. |
− | |||
− | |||
− | |||
− | |||
− | |||
− |
Revision as of 14:30, 9 March 2023
(1) Relations: Cartesian products, relations, properties of relations, equivalence relations and partitions. (2) Order relations: Partially ordered sets, totally ordered sets, extreme elements (maximum, minimum, maximal and minimal elements), well-ordered sets, maximality principles, Zorn's Lemma, lattices, boolean algebras, circuit design. (3) Graphs: Euler and Hamiltonian paths and circuits, matching, graph coloring, Ramsey’s theorem, trees and searching. (4) Binary operations: Groups and semigroups, products and quotients of groups, other algebraic structures.