# How do I formalize and prove or disprove this riddle?

I am trying to figure this out but have no clue where to even begin. Yes this is a question from a logic homework I have but I do not want an answer, just want to know how to approach this. I know all the logic concepts (demorgans law, dis-junction, conjunction, CDF formulas, etc...). I just don't know how to apply them here. Any ideas ? Here is the question.

“Bob has money. The car is silver. The car is fast. If the car is silver or if the car is fast, and Bob has money then Bob goes on vacation on a cruise.”

Formalize and prove or disprove this claim: Bob goes on vacation on a cruise.

A = Bob has money

B = The car is silver

F = The car is fast

C = Bob goes on vacation on a cruise

(B ∨ F) ∧ A → C

• "Bob has money" is $p$. "The car is silver" is $q$ and "The car is fast" is $r$. – Mauro ALLEGRANZA Feb 19 '17 at 19:57
• "Bob goes on vacation on a cruise” is $s$. – Mauro ALLEGRANZA Feb 19 '17 at 19:58
• Then you have to formalize "If the car is silver or if the car is fast, and Bob has money then Bob goes on vacation on a cruise” using the logical connectives : $\lor$ for or, $\land$ for and and $\to$ for "if..., then___". – Mauro ALLEGRANZA Feb 19 '17 at 19:58

Start off by assigning a symbol to each of your four propositions("Bob has money" may be represented by $B$, "car is silve"r by $S$ and so on..). Then convert the statement "the car is silver or if the car is fast, and Bob has money" into formal notation using conjunction/disjunction appropriately. In the last part, you say that the truth of the previous statement, implies that $V$ is true, where $V$ represents the proposition "Bob goes on vacation on cruise.".