For example:

P: Zhang San works hard.

Q: Li Si got good grades.

Then translate the above sentence into a propositional formula: P Q.

Unless p, q;

= q, unless p;

= Only P can be non-Q (otherwise it must be Q);

= If not P, then Q;

Extended data:

Discretization mainly studies the structures based on discrete quantities and their relationships, 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 specialized course for computer majors, 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. ?

Baidu encyclopedia-discrete mathematics