The propositional calculus of discrete mathematics can be abstracted into a symbolic calculus system, a->; B and! A, V and B are symbolic representations of the calculus system, and their calculus results are equal under any conditions, that is, they are equivalent in the calculus system.

Transforming one symbolic representation into another is called pattern matching (the two symbolic representations are equivalent).

24 questions can be deduced from the formulas in propositional calculus. If Formula 24 holds, then Formula 24 can also be used as a formula in propositional calculus to derive other formulas.

I think what the landlord is struggling with is why A-> B and! A V B is quite.

You can refer to our daily algebraic system:

1. Principle:

B& Lieutenant; = & gtA( 1) + A(2) +...+A(B)

A - B <= & gtA + (-B)

Both multiplication and subtraction are realized by addition.

2. Why

-Simple expression

-Simplify the operation process, and the operation results are consistent (mathematical equivalence). You can try to use addition and division, and realize it by program.

You can put the symbol->; If you are v! Redefine a new symbol.