without using a truth table prove the following:

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

- Mon Oct 21, 2013 3:04 am
- Forum: Discrete Math
- Topic: solve using inference and logic equivalence rules
- Replies:
**1** - Views:
**1320**

without using a truth table prove the following:

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

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