Prove: ~p ^ (~q ^ r) v (q ^ r) v (p ^ r) ≡ r

  • Thread starter Nuha22
  • Start date
No, I'm afraid I don't. I'm not familiar with the symbol <=> in logic, and I don't know what you mean by "conditional elimination".I'm afraid if you want to explain it you'll have to explain it as if to a stupid person - because that's what I am in this context!No, I'm afraid I don't. I'm not familiar with the symbol <=> in logic, and I don't know what you mean by "conditional elimination".I'm afraid if you want to explain it you'll have to explain it as if to a stupid person - because that's what I am in this context!Well, I tried to explain it with an example. Let me give you
  • #1
Nuha22
2
0


show that :
~p ^ (~q ^ r) v (q ^ r) v (p ^ r) ≡ r

when i made the truth table of course they were equivalent..

but i don't know what I'm doing wrong ! the end is always T "true" when i try to prove it logically... Please help !
 
Physics news on Phys.org
  • #2
Nuha22 said:
show that :
~p ^ (~q ^ r) v (q ^ r) v (p ^ r) ≡ r

when i made the truth table of course they were equivalent..

but i don't know what I'm doing wrong ! the end is always T "true" when i try to prove it logically...

There's a lot of simplification that you can do. For example, how can you rewrite (~q ^ r) v (q ^ r)?
 
  • #3
Nuha22 said:


show that :
~p ^ (~q ^ r) v (q ^ r) v (p ^ r) ≡ r

when i made the truth table of course they were equivalent..

but i don't know what I'm doing wrong ! the end is always T "true" when i try to prove it logically...


Please help !


What exactly do you mean by 'the end is always T "true" when i try to prove it logically...'?

Do you mean that the LHS becomes True once you've simplified it? If so, show us step by step how you got to that and someone will spot the error in your working.
 
  • #4
oay said:
What exactly do you mean by 'the end is always T "true" when i try to prove it logically...'?

Do you mean that the LHS becomes True once you've simplified it? If so, show us step by step how you got to that and someone will spot the error in your working.

Indeed. Please post your work or this thread will be deleted.
 
  • #5

Thank you all , but i have solved it ^^

~p ^ (~q ^ r) v (q ^ r) v (p ^ r) ≡ r


1- rearrange it:

[~p ^ (p ^ r) ] v (~q ^ r) v (q ^ r) ≡ r

[ (~p ^ p) ^ (~p ^ r) ] v (~q ^ r) v (q ^ r) ≡ r

[F ^ (~p ^ r) ] v (~q ^ r) v (q ^ r) ≡ r

F v (~q ^ r) v (q ^ r) ≡ r

(~q ^ r) v (q ^ r) ≡ r

[ (~q ^ r) v q) ] ^ [ (~q ^ r) v r) ] ≡ r

(~q v q ) ^ ( r v q ) ^ ( ~q v r ) ^ ( r v r ) ≡ r

Put braces :

(~q v q ) ^ [ ( r v q ) ^ ( ~q v r ) ] ^ ( r v r ) ≡ r

* [ ( r v q ) ^ ( ~q v r ) ] ==> r v (q ^ ~q)

* ( r v r ) => r

T ^ [ r v (q ^ ~q) ] ^ r ≡ r

* (q ^ ~q) => F

T ^ r ^ r ≡ r

*( r ^ r) => r

T ^ r ≡ r

^^



Al7amdulillah <3
 
  • #6
Nuha22 said:
Thank you all , but i have solved it ^^
I think you got lucky! :smile:

1- rearrange it:

[~p ^ (p ^ r) ] v (~q ^ r) v (q ^ r) ≡ r
The first line in your "rearrangement" seems invalid to me but almost trivially causes your LHS to be equivalent to r.

The original LHS is:
~p ^ (~q ^ r) v (q ^ r) v (p ^ r)

and your rearrangement is:
[~p ^ (p ^ r)] v (~q ^ r) v (q ^ r)

As (q ^ r) is common to both of these expressions, you are effectively saying that:
~p ^ (~q ^ r) v (p ^ r) ≡ [~p ^ (p ^ r)] v (~q ^ r)

which is NOT the case.

I'm actually having a hard time trying to object to your reasoning as each step is logically correct and equivalent to the previous one; it's just your initial rearrangement where I can't understand how you got to it!

It looks like you saw A ^ B v C v D and thought you could rearrange it to be [A ^ D] v B v C, which in general is not true. :smile:

(I may be making a complete fool of myself here if I've missed something obvious!)

The original LHS can actually be simplified to r in about 3 steps as Mark was hinting at earlier.
 
  • #7
The first part of your statement, "~p" says that p is false. That means that "p^r" is false so that statement reduces to "(~q^r)v(q^r)". If q is false, "q^r" is false so we must have "~q^r" and so r is true. If q is true, "~q^r" is false so we must have "q^r" and so r is true. In any case, r is true.
 
  • #8
HallsofIvy said:
The first part of your statement, "~p" says that p is false. That means that "p^r" is false so that statement reduces to "(~q^r)v(q^r)". If q is false, "q^r" is false so we must have "~q^r" and so r is true. If q is true, "~q^r" is false so we must have "q^r" and so r is true. In any case, r is true.
Maybe I'm being stupid, but this post makes no sense to me.

r isn't necessarily true or false. It's not a question of finding whether r is true or false; it's about proving that the LHS is equivalent to r.
 
  • #9
oay said:
Maybe I'm being stupid, but this post makes no sense to me.

r isn't necessarily true or false. It's not a question of finding whether r is true or false; it's about proving that the LHS is equivalent to r.

Anyone?
 
  • #10
oay said:
Anyone?

A pity , you fail to fathom still after such excellent hints. Do you know what <=> in Proposition means ? If I say , that p<=>q , then p<=>q = (p=>q)^(q=>p) = (~p+q)^(~q+p).

Use this theorem in your question and prove ! Well truth is easiest method , but if you are not satisfied then use conditional elimination , as I stated. Let's see what you get.

Do you know about tautology , contrapositive , converse , etc.. in propositional logic ?
 
  • #11
oay said:
It looks like you saw A ^ B v C v D and thought you could rearrange it to be [A ^ D] v B v C, which in general is not true. :smile:

(I may be making a complete fool of myself here if I've missed something obvious!)
You're right. Nuha22's solution is wrong for the reason you noted.
 
  • #12
sankalpmittal said:
A pity , you fail to fathom still after such excellent hints.
I think you may be confusing me with the OP (Nuha22), who hasn't responded for over a week, possibly still believing that he's "solved" it.

vela said:
You're right. Nuha22's solution is wrong for the reason you noted.
Thanks. :smile:

But I'm still not sure what Ivy was getting at...
 
  • #13
oay said:
I think you may be confusing me with the OP (Nuha22), who hasn't responded for over a week, possibly still believing that he's "solved" it.

Thanks. :smile:

But I'm still not sure what Ivy was getting at...

Yeah ! I mistaken you for OP , who was Nuha22 ! Silly me ! I apologize for that though. :smile:

And yes , you're right. Ivy's hint was slightly confusing and little hard to fathom. But he was right. And that's what I stated , in my previous post. Ivy was using "conditional elimination." If you prove the statement to be a tautology , not a contradiction , then indeed , the inference from the premises is derived.
 
  • #14
sankalpmittal said:
Yeah ! I mistaken you for OP , who was Nuha22 ! Silly me ! I apologize for that though. :smile:

And yes , you're right. Ivy's hint was slightly confusing and little hard to fathom. But he was right. And that's what I stated , in my previous post. Ivy was using "conditional elimination." If you prove the statement to be a tautology , not a contradiction , then indeed , the inference from the premises is derived.
I'm quite happy to be corrected, but I think Ivy is female.

I still don't understand what she or you mean. I don't mean to be any mathematical genius.

I'm sure I can solve the OP's problem, but Ivy's reasoning is a bit confusing to me.
 

1. What is the meaning of the symbols in the expression?

The symbol "~" represents negation, "^" represents conjunction, "v" represents disjunction, and "≡" represents equivalence.

2. What is the logical connective used in this expression?

The logical connective used in this expression is equivalence, denoted by "≡".

3. How can this expression be proven?

This expression can be proven using the laws of logical equivalences, such as the distributive law and De Morgan's laws.

4. What is the importance of proving this expression?

Proving this expression can help in understanding the relationships between different logical statements and can also be used in constructing more complex logical proofs.

5. Can this expression be simplified?

Yes, this expression can be simplified using the distributive law to eliminate the parentheses and simplify the expression. It can also be simplified using De Morgan's laws to negate the statements and make the expression easier to understand.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
20
Views
1K
  • Calculus and Beyond Homework Help
Replies
24
Views
804
Replies
4
Views
705
  • Linear and Abstract Algebra
Replies
11
Views
1K
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
  • Precalculus Mathematics Homework Help
Replies
1
Views
1K
  • Precalculus Mathematics Homework Help
Replies
12
Views
2K
Replies
1
Views
754
Replies
1
Views
158
Replies
11
Views
374
Back
Top