Will Martha Find a Car That Meets Her Demands?

  • Thread starter Thread starter some_one
  • Start date Start date
AI Thread Summary
Martha is looking for a car that is both fast and cheap, with specific conditions regarding color and type: it must be painted silver or be a convertible, but not both. The discussion revolves around identifying which argument supports the conclusion that Martha cannot find a car meeting her criteria. The consensus indicates that the first argument, stating that a fast car is not cheap unless it is painted silver and convertible, leads to the conclusion that her requirements cannot be satisfied. Additionally, a logical expression is proposed to represent the conditions under which Martha would successfully buy a car. The expression is structured to reflect the necessary conditions of being fast or cheap, while also accounting for the restrictions on color and type. The discussion also touches on the complexity of formal logic and suggests that there may be simpler ways to approach the problem, indicating that the original poster might already have the answer. Ultimately, the conclusion is that the first argument effectively demonstrates the impossibility of finding a suitable car for Martha.
some_one
Messages
78
Reaction score
1
martha wants to buy a fast and a chip car which answers to this term:
the car should be painted in silver or a convertible ,but not both.

which one of the following arguments will lead us to the conclusion
that martha will not find a car which fits by her demands?
1.a fast car which is not chip,unless its painted in silver and it a convertible
2.a fast car painted in silver,but its not a convertible
3.a chip car will never be painted in silver
4.a convertible car are not fast and they are not painted in silver
 
Physics news on Phys.org
So let's define some properties:
F: the car is fast
Ch: the car is cheap
S: the car is painted silver
Co: the car is convertible

Now can you make a logical expression which is true when she does buy the car? So I'm looking for something of the form: (F or Ch) and (F and ((not Co) or S).
Also try to express the answer possibilities this way (as an example, number 1 would become: (F \wedge \neg Ch) \vee (S \wedge Co)).

Once you have that, I will of course ask you if you can negate that expression.
 
I doubt the OP has experience with formal logic, let alone symbolic logic, CompuChip.
 
Is there an easier way to solve it, then?

By the way I just noticed this is posted in "general discussion > brain teasers" so maybe the question is for us to find the answer and the OP already has it.
 
i am having the final answer
bur i don't have the way its being solved
 
i think i got the way they solved it
its 1
because in that way the car will be silver and convertible
which is not possible
 
Back
Top