solve using inference and logic equivalence rules  TOPIC_SOLVED

Sequences, counting (including probability), logic and truth tables, algorithms, number theory, set theory, etc.

solve using inference and logic equivalence rules

Postby beast on Mon Oct 21, 2013 3:04 am

without using a truth table prove the following:

(j--->a) and (s--->h) and (j or s) ---> (a--->j) or (h--->s)
beast
 
Posts: 1
Joined: Mon Oct 21, 2013 3:01 am

Sponsor

Sponsor
 

Re: solve using inference and logic equivalence rules  TOPIC_SOLVED

Postby nona.m.nona on Thu Oct 24, 2013 10:36 am

beast wrote:without using a truth table prove the following:

(j--->a) and (s--->h) and (j or s) ---> (a--->j) or (h--->s)

I would suggest proceeding by contrapositive or contradiction. Make assumptions about the "then a-then-j or h-then-s", and see where this leads.

If you are working with a different method of your preference, kindly please reply with your efforts thus far. Thank you.
nona.m.nona
 
Posts: 252
Joined: Sun Dec 14, 2008 11:07 pm


Return to Discrete Math