How to judge conjunctive normal form and disjunctive paradigm in discrete mathematics

As long as the conjunction of each item in the connection formula is ∧ or ∨, then the formula is conjunctive normal form and ∨ is disjunctive normal form.

For example: (A ∨ B ∨ C) ∧ (? A ∨┐ B ∨┐ C) ∧ (A ∨┐ B ∨ C) is conjunctive normal form;

(A ∧ B ∧ C) ∨ (A ∧ B ∧ C) ∨ (A ∧ B ∧ C) is a disjunctive paradigm.

The formula can be written as conjunctive normal form or disjunctive normal form, which can be obtained by equivalent relation operation.

Discrete mathematics is a mathematical discipline that studies the structure and relationship of discrete quantities and an important branch of modern mathematics. The meaning of discreteness refers to different connecting elements. The structure based on discreteness and the relationship between them are mainly studied, and its objects are generally finite or countable elements. Discrete mathematics is widely used in various disciplines, especially in the field of computer science and technology. At the same time, discrete mathematics is also a necessary prerequisite for many professional courses of computer specialty, such as programming language, data structure, operating system, compilation technology, artificial intelligence, database, algorithm design and analysis, theoretical computer science foundation and so on. Through the study of discrete mathematics, we can not only master the descriptive tools and methods for dealing with discrete structures, but also create conditions for subsequent courses, improve abstract thinking and strict logical reasoning ability, and lay a solid foundation for participating in innovative research and development in the future.