The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Tautology Proof Question
Replies: 1   Last Post: Mar 19, 2012 5:51 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Angela Richardson

Posts: 42
From: UK
Registered: 6/22/11
Re: Tautology Proof Question
Posted: Mar 19, 2012 5:51 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply
att1.html (1.9 K)

(p -> r) is equivalent to (¬p v r)    i.e p implies r means that r is true or p is not true.
(p v q) ^ (¬p v r) ^ (¬q v r)  and (p ^ ¬p) v (r ^ q) ^ (¬q v r)  both mean that  p or q is true, and r is true or p is false, and r is true or q is false.  
(p ^ ¬p) is false hence (r ^ q) ^ (¬q v r) is true, and r and q being true implies r is true. 


From: Ashraf Samhouri <>
Sent: Monday, 19 March 2012, 8:51
Subject: Tautology Proof Question

Hello guys,

While studying, I've passed through this proof (in the class notes):

Proof that:
( (p v q) ^ (p -> r) ^ (q -> r) ) -> r
is a tautology?

The solution is:
( (p v q) ^ (¬p v r) ^ (¬q v r) ) -> r
( (p ^ ¬p) v (r ^ q) ^ (¬q v r) ) -> r
(F v (q ^ ¬q) v r) -> r
r -> r
¬r v r
.: T

Actually I can't understand the steps, am not sure if the notes are
well-written here, but I'll appreciate any help in explaining the


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.