Question

Discrete mathematics counterexamples - Supplementary question: S1.) Give a counterexample to show that "∀x(p(x) --> Q(x))...

Discrete mathematics counterexamples -

Supplementary question:

S1.) Give a counterexample to show that "∀x(p(x) --> Q(x)) and ∀xP(x) --> ∀xQ(x)" may not be logically equivalent.

Homework Answers

Answer #1

Let's say we're dealing with the domain of the set of living humans. And let's define:

P(x) = x is a genetic male

Q(x) = x is a genetic female

Then ∀x P(x) says everyone is a male, which is obviously false.

And ∀x Q(x) says everyone is a female, which is also obviously false.

So the 'or' of these: ∀x P(x) ∨∀x Q(x)   

says everyone is a male or everyone is a female is false as well.

But the expression: ∀x ( P(x) ∨ Q(x) ) says:

All people are either male or female, which is true.

This one counter-example is enough to prove your expressions are not logically equivalent.

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
Show the following are not logically equivalent: ∀xP (x) ∨ ∀xQ(x) and ∀x(P (x) ∨ Q(x)).
Show the following are not logically equivalent: ∀xP (x) ∨ ∀xQ(x) and ∀x(P (x) ∨ Q(x)).
Show that ∀xP (x) ∨ ∀xQ(x) ̸≡ ∀x [P (x) ∨ Q(x)] By defining a universe...
Show that ∀xP (x) ∨ ∀xQ(x) ̸≡ ∀x [P (x) ∨ Q(x)] By defining a universe of discourse and predicts P, Q over it such that one side of the expression evaluates to true and the other side evaluates to false.
(1) Determine whether the propositions p → (q ∨ ¬r) and (p ∧ ¬q) → ¬r...
(1) Determine whether the propositions p → (q ∨ ¬r) and (p ∧ ¬q) → ¬r are logically equivalent using either a truth table or laws of logic. (2) Let A, B and C be sets. If a is the proposition “x ∈ A”, b is the proposition “x ∈ B” and c is the proposition “x ∈ C”, write down a proposition involving a, b and c that is logically equivalentto“x∈A∪(B−C)”. (3) Consider the statement ∀x∃y¬P(x,y). Write down a...
If X does not occur free in Q, then ∀X(P(X) -> Q) is semantically equivalent with∃XP(X)...
If X does not occur free in Q, then ∀X(P(X) -> Q) is semantically equivalent with∃XP(X) -> Q. Give an example to show that these formulas will not necessarily be equivalent if X does occur free in Q.
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...
Let P and Q be statements: (a) Use truth tables to show that ∼ (P or...
Let P and Q be statements: (a) Use truth tables to show that ∼ (P or Q) = (∼ P) and (∼ Q). (b) Show that ∼ (P and Q) is logically equivalent to (∼ P) or (∼ Q). (c) Summarize (in words) what we have learned from parts a and b.
1) Show that ¬p → (q → r) and q → (p ∨ r) are logically...
1) Show that ¬p → (q → r) and q → (p ∨ r) are logically equivalent. No truth table and please state what law you're using. Also, please write neat and clear. Thanks 2) .Show that (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a tautology. No truth table and please state what law you're using. Also, please write neat and clear.
are they logically equivalent (show how) truth table or in word:: a) p —> ( q...
are they logically equivalent (show how) truth table or in word:: a) p —> ( q —> r ) and ( p -> q) —> r b) p^ (q v r ) and ( p ^ q) v ( p ^ r )
Discrete Mathematics (a) Let P(x) be the predicate “−10 < x < 10” with domain Z+...
Discrete Mathematics (a) Let P(x) be the predicate “−10 < x < 10” with domain Z+ (the set of all positive integers). Find the truth set of P(x). (b) Rewrite the statement Everybody trusts somebody in formal language using the quantifiers ∀ and ∃, the variables x and y, and a predicate P(x,y) that you must define. (c) Write the negation of the statement in (b) both formally and informally.
let x be a discrete random variable with positive integer outputs. show that P(x=k) = P(...
let x be a discrete random variable with positive integer outputs. show that P(x=k) = P( x> k-1)- P( X>k) for any positive integer k. assume that for all k>=1 we have P(x>k)=q^k. use (a) to show that x is a geometric random variable.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT