Are These Predicate Logic Equivalences Valid?

In summary, equivalence in terms of predicates refers to two predicates that have the same truth values for all possible inputs. The equivalence of predicates can be determined by constructing a truth table for each predicate and comparing the outputs for all possible inputs. Logical equivalence and material equivalence have different meanings and applications. The equivalence of predicates can be used in mathematical proofs to simplify expressions and show equivalency. Two predicates can be equivalent but not identical, meaning they produce the same outputs but may have different forms or structures.
  • #1
rooski
61
0

Homework Statement



state whether the equivalences are valid for P and Q

(latex is screwing up, wherever a letter has been made into superscript it should be normal and there should be a ^ in front of it).

1.. [tex]poop \exists x [ P(x) ^ \wedge p Q(x) ] \equiv \exists x P(x) \wedge \exists x Q(x)[/tex]

2.. [tex]\exists x \exists y [ P(x) \wedge Q(y) ] \equiv \exists x P(x) \wedge \exists x Q(x) [/tex]

The Attempt at a Solution



I get the jist of what I'm supposed to prove, but i don't know how to properly formulate my response. I think there are some holes in my logic too. Can i get some critique?

Q1: Assume the LHS is true. It follows that the RHS is also true. This means we have a variable k Such that P(k) ^ Q(k) (on the LHS) is true. It follows that P(k) is true and Q(k) is true. Since P(k) is true for the variable k then we can say that [tex]\exists x P(x)[/tex] holds true if we choose x = k. This logic can also be applied to Q(x). Thus we conclude that the equivalence is valid.

Q2: Assume the LHS and RHS are true. This means that for 2 values k and n, P(k) and Q(n) are both true. Looking at the RHS we can say that [tex]\exists x P(x)[/tex] holds true if we choose x = k. The same can be said for [tex]\exists x Q(x)[/tex] if we choose x = n. Thus we conclude the equivalence is valid.
 
Last edited:
Physics news on Phys.org
  • #2
rooski said:

Homework Statement



state whether the equivalences are valid for P and Q

(latex is screwing up, wherever a letter has been made into superscript it should be normal and there should be a ^ in front of it).

1.. [tex]\exists x [ P(x) ^ \wedge p Q(x) ] \equiv \exists x P(x) \wedge \exists x Q(x)[/tex]

2.. [tex]\exists x \exists y [ P(x) \wedge Q(y) ] \equiv \exists x P(x) \wedge \exists x Q(x) [/tex]


The Attempt at a Solution



I get the jist of what I'm supposed to prove, but i don't know how to properly formulate my response. I think there are some holes in my logic too. Can i get some critique?

Q1: Assume the LHS is true. It follows that the RHS is also true. This means we have a variable k Such that P(k) ^ Q(k) (on the LHS) is true. It follows that P(k) is true and Q(k) is true. Since P(k) is true for the variable k then we can say that [tex]\exists x P(x)[/tex] holds true if we choose x = k. This logic can also be applied to Q(x). Thus we conclude that the equivalence is valid.
No. The LHS says that there exist a value of x such that both P(x) and Q(x) are true for that value of x. The RHS says that there exist a value of x such that P(x) is true and that the exist a value of x (possibly different) such that Q(x) is true. Suppose P(x) is "x+ 1= 0" and Q(x) is "x- 2= 0". Then [itex]\exists x P(x) \wedge \exists x Q(x)[/itex] is true- P(-1) is true so [itex]\exists x P(x)[/itex] is true and Q(2) is true so [itex]\exists x Q(x)[/itex] is true. That is [itex]\exists x P(x)\wedge \exists x Q(x)[/itex] is true.
But [itex]\exists x P(x)\wedge Q(x)[/itex] is false because there does NOT exist a single value of x that makes both P(x) and Q(x) true.

Q2: Assume the LHS and RHS are true. This means that for 2 values k and n, P(k) and Q(n) are both true. Looking at the RHS we can say that [tex]\exists x P(x)[/tex] holds true if we choose x = k. The same can be said for [tex]\exists x Q(x)[/tex] if we choose x = n. Thus we conclude the equivalence is valid.
Yes, this is valid.
 
  • #3
HallsofIvy said:
No. The LHS says that there exist a value of x such that both P(x) and Q(x) are true for that value of x. The RHS says that there exist a value of x such that P(x) is true and that the exist a value of x (possibly different) such that Q(x) is true. Suppose P(x) is "x+ 1= 0" and Q(x) is "x- 2= 0". Then [itex]\exists x P(x) \wedge \exists x Q(x)[/itex] is true- P(-1) is true so [itex]\exists x P(x)[/itex] is true and Q(2) is true so [itex]\exists x Q(x)[/itex] is true. That is [itex]\exists x P(x)\wedge \exists x Q(x)[/itex] is true.
But [itex]\exists x P(x)\wedge Q(x)[/itex] is false because there does NOT exist a single value of x that makes both P(x) and Q(x) true.


Yes, this is valid.

Thanks for clarifying. Your example helps make it clear that they cannot be valid, i think i'll start using examples like that in proving equivalences are not valid.

Is my wording in Q2 good? I feel as though i didn't quite illustrate well enough that the equivalence is valid.
 
  • #4
I would not have said "Assume the LHS and RHS are true". You want to prove that if one is true, the other must be. Rather what you should do is say "Assume the LHS is true", determine under what conditions on P(x) and Q(y) that is correct and show that those conditions lead to the RHS being true. Then, of course, turn around, assume the RHS is true and show that leads to the LHS is true.
 

1. What is the definition of equivalence in terms of predicates?

Equivalence in terms of predicates refers to two predicates that have the same truth values for all possible inputs or arguments. In other words, if two predicates are equivalent, they will produce the same output for any given input.

2. How is the equivalence of predicates determined?

The equivalence of predicates can be determined by constructing a truth table for each predicate and comparing the outputs for all possible inputs. If the truth values for each input are identical, then the predicates are considered equivalent.

3. What is the difference between logical equivalence and material equivalence?

Logical equivalence refers to the relationship between two statements or predicates that have the same meaning, while material equivalence refers to the relationship between two statements or predicates that have the same truth values. In other words, two statements can be logically equivalent even if they have different truth values, but they cannot be materially equivalent.

4. How can the equivalence of predicates be used in mathematical proofs?

The equivalence of predicates can be used in mathematical proofs to simplify expressions or to show that two expressions are equivalent. This can help make complex proofs more concise and easier to understand.

5. Can two predicates be equivalent but not identical?

Yes, two predicates can be equivalent but not identical. This means that while they produce the same outputs for all possible inputs, they may have different forms or structures. For example, x > 5 and x - 5 > 0 are equivalent predicates, but they are not identical.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
4
Views
745
  • Engineering and Comp Sci Homework Help
Replies
1
Views
1K
  • Precalculus Mathematics Homework Help
Replies
2
Views
1K
  • Math Proof Training and Practice
Replies
10
Views
1K
  • Topology and Analysis
Replies
2
Views
1K
  • Precalculus Mathematics Homework Help
Replies
5
Views
1K
Replies
6
Views
352
  • Calculus and Beyond Homework Help
Replies
24
Views
793
  • Calculus and Beyond Homework Help
Replies
0
Views
161
  • Precalculus Mathematics Homework Help
Replies
1
Views
1K
Back
Top