Knowledge points for review at the end of discrete mathematics

first part  

Basic knowledge points: propositions, connectives, types of proposition formulas, minimal terms, maximal terms, assignments to be true
( assignments to false), basic equivalences, inference laws (including propositions, predicate logic), symbolization (propositions) , Predicate)
1. Find two main paradigms of proposition formula (emphasis 3 yuan)
2. Construct proposition formula sequence proof method (proof method of correct reasoning)
      In addition, you also need to master truth table method, equivalent algorithm, main paradigm law

Part II
Basic knowledge points: operations of sets (including relations), power sets, binary relations and properties,
equivalence relations, divisions, partial order relations, Hass diagrams, functions and properties
1. Add the relations on A by adding The least ordered pairs make it have a certain property (such as closure)
2. Construct an equivalence relation and partial order relation on a given set
3. Determine whether a relation is a function? If so, what are the properties of the function?
(Surf shot, single shot or double shot?)

Part III
Basic knowledge points: binary operations, algebraic constants, algebraic systems (including sub-algebraic systems), semigroups,
unique points, groups, rings, domains
1. Will judge whether an operation is binary on a given set Operation.
2. It will determine whether a binary operation has identity or zero. If an element has an inverse element, its inverse element can be found.
3. Will judge whether the algebraic system is semigroup, unique point, group, ring, domain.

Part IV
Basic knowledge points: simple graphs, subgraphs (including generating subgraphs), Kn, n-order directed complete graphs,
isomorphisms, paths, paths, cycles, connected graphs

Guess you like

Origin blog.csdn.net/qq_30787727/article/details/112372779