¬(P ∧ Q) ≡ (¬P) ∨ (¬Q)
时间: 2023-11-17 22:07:34 浏览: 140
avinayak.github.io:¬
This is one of De Morgan's laws, which states that the negation of a conjunction (P ∧ Q) is equivalent to the disjunction of the negations of its individual propositions (¬P) ∨ (¬Q):
¬(P ∧ Q) ≡ ¬P ∨ ¬Q
This law can be useful in simplifying logical expressions and in proving logical equivalences.
阅读全文