1 
Title 
Boolean function theory 
2 
Course 
1^{st} course, qualification: mathematics, research and development 
3 
Semester 
2 
4 
Credits 
2 
5 
Name and Surname of the lecturer 
PhD, associate professor Suprun Valery Pavlovich

6 
Main goals 
Introduction into Boolean functions theory, as a branch of discrete mathematics. Evolution of mathematical skills of thinking implementing for typical mathematical tasks solving.
Mandatory skills for graduate students: – formulize main definitions of Boolean functions theory; – implement definitions and propositions for typical tasks of logic design in electronics; – use main points of Boolean functions theory for various section of mathematics. 
7 
Knowledge 
Basic knowledge of combinatory, set theory, linear algebra 
8 
Content 
Definitions and techniques of Boolean functions representations. Minimizations and expansions generating. Boolean differentiation. Post’s theorem. 
9 
Literature 
1. Glushkov V.M. Sinthesis of digital machines. M..: Fizmatlit, 1962. 2. Pospelov D.A. Logical methods of analisis and logic circuits. M.: Energia, 1974. 3. Yablonski S.V. Vvedenie v discrete matematicu. M.: Nauka, 1986. 4. Suprun V.P. OSnovi matematicheskoi logiki. M.: Lenand / URSS, 2017. 
10 
Form of lectures 
Dialogic, demonstration, heuristic, problematic, researching 
11 
Literature 
Russian 
12 
Testing forms 
Theoretical and writing tests 
13 
Form of exam 
test 