solve using inference and logic equivalence rules

Sequences, counting (including probability), logic and truth tables, algorithms, number theory, set theory, etc.
beast
Posts: 1
Joined: Mon Oct 21, 2013 3:01 am
Contact:

solve using inference and logic equivalence rules

Postby beast » 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)

nona.m.nona
Posts: 263
Joined: Sun Dec 14, 2008 11:07 pm
Contact:

Re: solve using inference and logic equivalence rules

Postby nona.m.nona » 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.


Return to “Discrete Math”

cron