Discrete Math

Five topics are presented: the theory of sets, the Bulev Algebra of Logic, the theory of final machines, combinatorics and the theory of graphs. From the theory of sets, topics are highlighted: algebra of sets, binary relationships, endless sets, theory of fuzzy sets. From the Boolean Algebra - minimizing the Boolery formulas in disjunctive and conjunctive normal forms, taking into account uncertain states, Bohery equations, the first information about the Boolean differential and integral calculus. From the theory of final machines - the synthesis of logical (combination) and multi -stroke schematic schemes, the theorem of the post on functional completeness. From combinatorics - placement, combination and permutation with repetitions and without repetitions, separation of sets, etc. From the theory of graphs - graphs and oriented columns, networks, trees, etc. more than 2600 tasks and exercises for independent work and 620 tasks for testing are given. All exercises for independent work are given answers.
For students of technical specialties of universities and technical schools, senior school students of secondary schools and for everyone to independently undergo an introductory course of applied discrete mathematics