0
   

Logic Proof Help

 
 
Reply Sun 5 Jun, 2016 11:16 pm
I have to use logical equivalences to prove that the following three formulas are equal:
a → (b → c),
(a ∧ b) → c,
(a → b) → (a → c)

I did the first two and got ¬a V ( ¬b V c) and (¬a V ¬b) V c, respectively, so they're equal through association of V. I'm having difficulty with the last formula though. I did implicit elimination three times and ended up with (a ∧ ¬b) V (¬a V c). I'm not sure how to continue from here, I've tried distribution so far but that didn't seem to work. Any advice or tips?
  • Topic Stats
  • Top Replies
  • Link to this Topic
Type: Question • Score: 0 • Views: 927 • Replies: 2
No top replies

 
fresco
 
  1  
Reply Mon 6 Jun, 2016 09:28 am
@crimhaze,
Have you written out the truth tables ?
0 Replies
 
fresco
 
  1  
Reply Wed 8 Jun, 2016 09:27 am
@crimhaze,
If you examine the truth tables you will find that the expressions are equivalent since only the combination a=T, b=T, c=F will give an F in each case.
0 Replies
 
 

Related Topics

A2K challenge! - Discussion by HexHammer
THE TEN COMMANDMENTS OF LOGIC - Discussion by Ragman
Derivations vs. symbolisation? - Question by collegestudent123
Logic word problem - Question by johnr
Cause of death..... - Discussion by gungasnake
Need help in defining - Question by ichishti
Predicate Logic Help - Question by splenax
 
  1. Forums
  2. » Logic Proof Help
Copyright © 2019 MadLab, LLC :: Terms of Service :: Privacy Policy :: Page generated in 0.03 seconds on 04/23/2019 at 08:15:47