Question

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

Homework Answers

Answer #1

1. The negation of the given statement is "At least one dog does not like a flavor of BRAND XYZ dog food".

2. The sign '=' will be used as equivalence between statements

Conditional rule

Distributive rule

Distributive rule

Distributive rule

The second statement (in the bracket) becomes q because when q is true the statement is true and when q is false it is false.

De Morgan's rule

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. Construct a truth table for: (¬p ∨ (p → ¬q)) → (¬p ∨ ¬q) 2....
1. Construct a truth table for: (¬p ∨ (p → ¬q)) → (¬p ∨ ¬q) 2. Give a proof using logical equivalences that (p → q) ∨ (q → r) and (p → r) are not logically equivalent. 3.Show using a truth table that (p → q) and (¬q → ¬p) are logically equivalent. 4. Use the rules of inference to prove that the premise p ∧ (p → ¬q) implies the conclusion ¬q. Number each step and give the...
Consider the following (true) statement: “All birds have wings but some birds cannot fly.” Part 1...
Consider the following (true) statement: “All birds have wings but some birds cannot fly.” Part 1 Write this statement symbolically as a conjunction of two sub-statements, one of which is a conditional and the other is the negation of a conditional. Use three components (p, q, and r) and explicitly state what these components correspond to in the original statement. Hint: Any statement in the form "some X cannot Y" can be rewritten equivalently as “not all X can Y,”...
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...