Question

Prove for the following that one element of the pair is logically equivalent to the other...

Prove for the following that one element of the pair is logically equivalent to the other one using logical equivalences:

a) ~d -> (a && b && c) = ~(a && ~d) && ((d || b) & (c || d))

b) (a->b) && (c->d) = (c NOR a) || (b && ~c) || (d && ~a) || (b && d)

c) (~a && ~b) <--> (c || d) = (a || b || c || d) && ~((a || b) && (c || d))

d) (a XOR b) -> (~c XOR d) = ((a NOR b) || (a && b)) || ((c NOR d) || (c && d))

Homework Answers

Answer #1

a)

a b c d (¬d → (a ∧ (b ∧ c)))
F F F F F
F F F T T
F F T F F
F F T T T
F T F F F
F T F T T
F T T F F
F T T T T
T F F F F
T F F T T
T F T F F
T F T T T
T T F F F
T T F T T
T T T F T
T T T T T
a b c d (¬(a ∧ ¬d) ∧ ((d ∨ b) ∧ (c ∨ d)))
F F F F F
F F F T T
F F T F F
F F T T T
F T F F F
F T F T T
F T T F T
F T T T T
T F F F F
T F F T T
T F T F F
T F T T T
T T F F F
T T F T T
T T T F F
T T T T T

As last columns of both tables not same

~d -> (a && b && c) != ~(a && ~d) && ((d || b) & (c || d))

=====================================

b)

a b c d ((a → b) ∧ (c → d))
F F F F T
F F F T T
F F T F F
F F T T T
F T F F T
F T F T T
F T T F F
F T T T T
T F F F F
T F F T F
T F T F F
T F T T F
T T F F T
T T F T T
T T T F F
T T T T T
a b c d (¬(c ∨ a) ∨ ((b ∧ ¬c) ∨ ((d ∧ ¬a) ∨ (b ∧ d))))
F F F F T
F F F T T
F F T F F
F F T T T
F T F F T
F T F T T
F T T F F
F T T T T
T F F F F
T F F T F
T F T F F
T F T T F
T T F F T
T T F T T
T T T F F
T T T T T

As last columns of both tables are same

(a->b) && (c->d) = (c NOR a) || (b && ~c) || (d && ~a) || (b && d)

=====================================

c)

a b c d ((¬a ∧ ¬b) ↔ (c ∨ d))
F F F F F
F F F T T
F F T F T
F F T T T
F T F F T
F T F T F
F T T F F
F T T T F
T F F F T
T F F T F
T F T F F
T F T T F
T T F F T
T T F T F
T T T F F
T T T T F
a b c d ((a ∨ (b ∨ (c ∨ d))) ∧ ¬((a ∨ b) ∧ (c ∨ d)))
F F F F F
F F F T T
F F T F T
F F T T T
F T F F T
F T F T F
F T T F F
F T T T F
T F F F T
T F F T F
T F T F F
T F T T F
T T F F T
T T F T F
T T T F F
T T T T F

As last columns of both tables are same

(~a && ~b) <--> (c || d) = (a || b || c || d) && ~((a || b) && (c || d))

=====================================

d)

a b c d (a XOR b) -> (~c XOR d)
F F F F T
F F F T T
F F T F T
F F T T T
F T F F T
F T F T F
F T T F F
F T T T T
T F F F T
T F F T F
T F T F F
T F T T T
T T F F T
T T F T T
T T T F T
T T T T T
a b c d ((a NOR b) || (a && b)) || ((c NOR d) || (c && d))
F F F F T
F F F T T
F F T F T
F F T T T
F T F F T
F T F T F
F T T F F
F T T T T
T F F F T
T F F T F
T F T F F
T F T T T
T T F F T
T T F T T
T T T F T
T T T T T

As last columns of both tables are same

(a XOR b) -> (~c XOR d) = ((a NOR b) || (a && b)) || ((c NOR d) || (c && d))

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
1.Write the negation of the following statement in English. Do not simply add the words “not”...
1.Write the negation of the following statement in English. Do not simply add the words “not” or “it is not the case that” or similar before the existing statement. “Every dog likes some flavor of Brand XYZ dog food.” 2. Prove that the compound statements are logically equivalent by using the basic logical equivalences (13 rules). At each step, state which basic logical equivalence you are using. (p → q) ∧ (¬r → q) and (p ∨ ¬r) → q
Show that the following two formulas are NOT logically equivalent by giving a model in which...
Show that the following two formulas are NOT logically equivalent by giving a model in which one is true and the other is false:   ∃x ( R(x) → S(x) ) and ¬ ∀x ( R(x) ∧ S(x) )
1) Given set A and {$} where {$} represents set with only one element. Prove there...
1) Given set A and {$} where {$} represents set with only one element. Prove there is bijection between A x {$} and A. 2) Given sets A, B. Prove A x B is equivalent to B x A using bijection. 3) Given sets A, B, C. Prove (A x B) x C is equvilaent to A x (B x C) using a bijection.
Use equivalences to prove the following (do not use truth tables) (P→Q1)∨(P→Q2)≡P→(Q1∨Q2) Hint: Start with the...
Use equivalences to prove the following (do not use truth tables) (P→Q1)∨(P→Q2)≡P→(Q1∨Q2) Hint: Start with the left-hand-side ((P→Q1)∨(P→Q2)). Apply a known equivalence to obtain an equivalent formula. Write down the equivalent formula and the equivalence used. Repeat this process until you obtain the right-hand side (P→(Q1∨Q2)). Does the following hold? If it does, then prove it using equivalences (similar to the previous question). If it does not hold then write a truth table that shows the two formulas are not...
prove that if C is an element of ray AB and C is not equal to...
prove that if C is an element of ray AB and C is not equal to A, then ray AB = ray AC using any of the following corollarys 3.2.18.) Let, A, B, and C be three points such that B lies on ray AC. Then A * B * C if and only if AB < AC. 3.2.19.) If A, B, and C are three distinct collinear points, then exactly one of them lies between the other two. 3.2.20.)...
Using the laws of propositional equivalence,  show that  p → p ∧ ( p → q) is logically...
Using the laws of propositional equivalence,  show that  p → p ∧ ( p → q) is logically equivalent to p → q. That means a chain of equivalences starting with the first expression and ending with p → q. Remember: The connective ∧ has higher precedence than the connective → so be sure to parse the original expression correctly! To start you off here's a possible first step. p → p ^ ( p → q) ≡   p → p ^...
Prove that for a square n ×n matrix A, Ax = b (1) has one and...
Prove that for a square n ×n matrix A, Ax = b (1) has one and only one solution if and only if A is invertible; i.e., that there exists a matrix n ×n matrix B such that AB = I = B A. NOTE 01: The statement or theorem is of the form P iff Q, where P is the statement “Equation (1) has a unique solution” and Q is the statement “The matrix A is invertible”. This means...
Prove the statements (a) and (b) using a set element proof and using only the definitions...
Prove the statements (a) and (b) using a set element proof and using only the definitions of the set operations (set equality, subset, intersection, union, complement): (a) Suppose that A ⊆ B. Then for every set C, C\B ⊆ C\A. (b) For all sets A and B, it holds that A′ ∩(A∪B) = A′ ∩B. (c) Now prove the statement from part (b)
Discrete Math 1. Write the compound statements  in disjunctive normal form. (Since they are logically equivalent, they...
Discrete Math 1. Write the compound statements  in disjunctive normal form. (Since they are logically equivalent, they have the same disjunctive normal form, so you only need to give one answer.   (p → q) ∧ (¬r → q) and (p ∨ ¬r) → q 2. Consider the premises: • It is not snowing today and it is windy; • School will be canceled only if it is snowing today; • If school is not canceled today, then our study group will...
Prove let n be an integer. Then the following are equivalent. 1. n is an even...
Prove let n be an integer. Then the following are equivalent. 1. n is an even integer. 2.n=2a+2 for some integer a 3.n=2b-2 for some integer b 4.n=2c+144 for some integer c 5. n=2d+10 for some integer d
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT