• edited by
15,985 views
60 60 votes

Which one of the following is the most appropriate logical formula to represent the statement?

"Gold and silver ornaments are precious".

The following notations are used:        

  • $G(x): x$ is a gold ornament
  • $S(x): x$ is a silver ornament        
  • $P(x): x$ is precious
  1. $\forall x(P(x) \implies (G(x) \wedge S(x)))$
  2. $\forall x((G(x) \wedge S(x)) \implies P(x))$
  3. $\exists x((G(x) \wedge S(x)) \implies P(x))$
  4. $\forall x((G(x) \vee S(x)) \implies P(x))$

10 Answers

Best answer
73 73 votes

The statement could be translated as, if $x$ is either Gold or Silver, then it would be precious. Rather than,

If $x$ is both Gold and Silver, as an item cannot both Gold and silver at the same time.

Hence Ans is (D).

• edited by
2 2 votes
This statement can be expressed as => For all X, x can be either gold or silver then the ornament X is precious => For all X, (G(X) v S(x)) => P(X).
1 1 vote

Option D

First thing that we need to keep in mind is to decide the domain. Since, they did'nt specified what x is,  we will take x as all ornaments in the universe.

Second thing, Here in the question the word and is misleading & it does'nt mean that the ornament will be Gold & Silver. It can either be Gold or Silver.

Third is correct choice of quantifier.

if we use existential quantifier, it will mean that at least one Gold or Silver ornament is precious, which is not what the statement is saying. if the ornament is Gold or Silver then it will be precious.(all Gold or Silver ornament are precious). So we have to use universal quantifier.

 

Answer:
Position:
Show:

Related questions

38 38 votes
9 answers 9 answers
10.1k
10.1k views
gatecse asked Sep 15, 2014
10,113 views
Consider the following well-formed formulae:$\neg \forall x(P(x))$$\neg \exists x(P(x))$$\neg \exists x(\neg P(x))$$\exists x(\neg P(x))$Which of the above are equivalent...
53 53 votes
9 answers 9 answers
16.6k
16.6k views
gatecse asked Sep 15, 2014
16,642 views
The binary operation $\Box$ is defined as follows$$\begin{array}{|c|c|c|} \hline \textbf{P} & \textbf{Q} & \textbf{P} \Box \textbf{Q}\\\hline \text{T} & \text{T}& \text{T...
133 133 votes
9 answers 9 answers
299k
299k views
Kathleen asked Sep 18, 2014
298,512 views
Identify the correct translation into logical notation of the following assertion.Some boys in the class are taller than all the girlsNote: $\text{taller} (x, y)$ is true...
36 36 votes
3 answers 3 answers
18.6k
18.6k views
Kathleen asked Sep 22, 2014
18,551 views
Consider a binary max-heap implemented using an array.Which one of the following array represents a binary max-heap?$\left\{25,12,16,13,10,8,14\right\}$ $\left\{25,14,...