Write the formal expression for the following logical conditions on a variable x in a computer program. Note, exercise 2 and 4 are 1 and 3 negated with De Morgan's law 1. 0
I just want the expression not the computer program this is discrete structures class
Introduction:
De Morgan's laws are a pair of rules that relate logical operators AND and OR to their negations NOT. The two laws are as follows:
-
The negation of a conjunction (AND) is the disjunction (OR) of the negations: ¬(P ∧ Q) ≡ ¬P ∨ ¬Q This law states that the negation of a statement that asserts that two things are true at the same time is equivalent to the statement that at least one of the two things is not true.
-
The negation of a disjunction (OR) is the conjunction (AND) of the negations: ¬(P ∨ Q) ≡ ¬P ∧ ¬Q This law states that the negation of a statement that asserts that at least one of two things is true is equivalent to the statement that neither of the two things is true.
In words, De Morgan's laws can be stated as "the negation of a conjunction is the disjunction of the negations" and "the negation of a disjunction is the conjunction of the negations." These laws are basic to many areas of mathematics and logic, and they are frequently used in the simplification of logical expressions.
Trending now
This is a popular solution!
Step by step
Solved in 5 steps
