Ggiven the following premises: (1) a∧(b∨a) (2) ~c→~a (3) ~g→~a (4) g→e (5)~(d∨h) prove the conclusion: c∧~h?

See the argument below

Step-by-step explanation:

I will give the argument in symbolic form, using rules of inference.

First, let's conclude c.

(1)⇒a  by simplification of conjunction

a⇒¬(¬a) by double negation

¬(¬a)∧(2)⇒¬(¬c) by Modus tollens

¬(¬c)⇒c by double negation

Now, the premise (5) is equivalent to ¬d∧¬h which is one of De Morgan's laws. From simplification, we conclude ¬h. We also concluded c before, then by adjunction, we conclude c∧¬h.

An alternative approach to De Morgan's law is the following:

By contradiction proof, assume h is true.

h⇒d∨h by addition

(5)∧(d∨h)⇒¬(d∨h)∧(d∨h), a contradiction. Hence we conclude ¬h.    

i don't have the answer rn but go to math papa. it shows the steps and the answer. hope this : )

step-by-step explanation:

the number of the people going.

step-by-step explanation:

the cost to buy one movie ticket is $7. if the total cost for the movie is a function of how many people go, then the input is : the number of the people going.