Note: y is correct, x is wrong
Lu Xiaoma's public account will give you a test question
1. Propositions are all declarative sentences y
2. Proposition formulas include contradictory and satisfiable formulas y
3. The proposition is a zero-element predicate, and a zero-element predicate is not necessarily the proposition y.
4. The equivalent values of the two propositional formulas are assigned in the same group The following is the same truth value y
5. Any propositional formula has two unique paradigms x (the only main paradigm y)
6. Any predicate formula has a unique toe paradigm x
7. All of the n propositional variables The main disjunctive paradigm of the propositional formula has at most finite kinds,
and it is 2 to the n-th power of 2 y
8. The equivalence relationship between the propositional formulas is an equivalence relationship (partial order relationship) y (x)
9, p-> The logical relationship of q is that q is a sufficient condition (necessary condition, necessary and sufficient condition) of p x (y, x)
10. The assignment of any proposition formula is either true or false. Assignment y
11. Truth table represents the proposition A way of formula y
12. The number of layers of any proposition formula is a positive integer x (integer y)
13. The form of the same proposition formula may be both disjunctive normal form and conjunctive normal form y
14. The same proposition formula may be It is both the main disjunctive paradigm and the main conjunctive paradigm y (A=p)
15. A propositional formula has a unique minimal term and a unique maximal term y
16. A correct reasoning may not necessarily lead to the true proposition y
17 , The formula corresponding to the law of reasoning is always true type y
18. Under a certain interpretation of a closed formula, its true value is unique y
19, the symbolized form of the same proposition may not be unique y
20, between vertices Connected relations are equivalence relations (partial order relations) y (x)
21. The mutually reachable relationship between vertices in a directed graph is an equivalence relationship (partial order relationship) y (x)
22. The isomorphism relationship between graphs is an equivalence relationship (partial order relationship) y (x)