• edited by
8,984 views
35 35 votes

Which of the following predicate logic formulae/formula is/are CORRECT representation(s) of the statement: "Everyone has exactly one mother"?

The meanings of the predicates used are:

  • mother $(y, x): y$ is the mother of $x$
  • noteq $(x, y): x$ and $y$ are not equal
  1. $\forall x \exists y \exists z(\operatorname{mother}(y, x) \wedge \neg \operatorname{mother}(z, x))$
  2. $\forall x \exists y[\operatorname{mother}(y, x) \wedge \forall z( \operatorname{noteq} (z, y) \rightarrow \neg \operatorname{mother} (z, x))]$
  3. $\forall x \forall y[\operatorname{mother}(y, x) \rightarrow \exists z( \operatorname{mother} (z, x) \wedge \neg \operatorname{note} q(z, y))]$
  4. $\forall x \exists y[\operatorname{mother}(y, x) \wedge \neg \exists z( \operatorname{note}  q(z, y) \wedge \operatorname{mother} (z, x))]$

6 Answers

19 19 votes

There is exactly one number which is prime. \[ \exists x \left( prime(x) \land \forall y \left( prime(y) \rightarrow (y = x) \right) \right) \] https://youtube.com/watch?v=vaewKZlZ8GY&si=j0H-kc7SI01fDc1E


 Everyone has exactly one mother. \[ \forall x \exists y \left( mother(y,x) \land \forall z \left( mother(z,x) \rightarrow \neg Noteq(z,y) \right) \right) \] As we know that : P--->Q is equalivalent to  7Q--->7P

\[ \boxed{ \forall x \exists y \left( mother(y,x) \land \forall z \left( Noteq(z,y) \rightarrow \neg mother(z,x) \right) \right) } \]\[ \forall x \exists y \left( mother(y,x) \land \forall z \left( \neg Noteq(z,y) \lor \neg mother(z,x) \right) \right) \] \[ \forall x \exists y \left( mother(y,x) \land \forall z \neg \left( Noteq(z,y) \land mother(z,x) \right) \right) \] \[ \boxed{ \forall x \exists y \left( mother(y,x) \land \neg \exists z \left( Noteq(z,y) \land mother(z,x) \right) \right) } \] Answer: B & D matches.

• edited by
7 7 votes

Let's deduce option by option:

Option A: $$
\forall x\;\exists y\;\exists z\;\big(\text{mother}(y,x)\land\lnot\text{mother}(z,x)\big)
$$
This translates to: For All x, There Exist a y, There Exist a z such that y is the mother of x and z is not the mother of x.

This option will be successful if we don't pick the same element i.e mother twice when choosing mother(y,x) and mother(z,x); if we don't choose y as z again. But if we pick same element again, this fails

Say y is the mother of x, so mother(y,x) will be True and if we pick the same y again for negation of mother(z,x), then as z is the mother of x, this will be False. 

Therefore, this option is wrong.

Option B: $$
\forall x \; \exists y \; \Big[ \text{mother}(y,x) \;\land\; 
   \forall z \; \big( \text{noteq}(z,y) \;\to\; \lnot \text{mother}(z,x) \big) \Big]
$$
This translates to For All x, There Exist a y such that y is the mother of x and For All z if z is not equal to y, then z is not the mother of x.

If you pick z which is not equal to y but if z is the mother of x, then this proposition will give False.
Hence, this is the correct option.

Option C: $$
\forall x \; \forall y \; \Big[ \text{mother}(y,x) \;\to\; 
   \exists z \; \big( \text{mother}(z,x) \;\land\; \lnot \text{noteq}(z,y) \big) \Big]
$$

This translates to For all x, For all y if y is the mother of x and There exist a z such that 
This option too fails
Say, there is a x which has two mothers y1 and y2.

If we pick y1 for mother(y,x) it will give True and if we pick y1 again for mother (z,x) will be true and the negation of noteq(z,y) will give True.
Then if we do the same as above for y2 too, this proposition will give True.

Hence, this option is also incorrect.

Option D: $$
\forall x \; \exists y \; \Big[ \text{mother}(y,x) \;\land\; 
   \lnot \exists z \; \big( \text{noteq}(z,y) \;\land\; \text{mother}(z,x) \big) \Big]
$$
This translates to For All x There Exist a y such that y is the mother of x and it is not the case that There Exist a z such that z and y are not equal and z is the mother of x.
This proposition will give False when a particular x has two mothers.

So, this option is correct. Hence, B and D are the correct options.

 


 

4 4 votes

No A is B

 ≡ for all x if it is A then it is not B ≡  ∀x ( A(x) -> ¬B(x) )

 ≡ There does not exist an x such that it is A and B  ≡ ¬∃x( A(x) ∧ B(x) )

D.∀x∃y[ mother⁡(y,x) ∧ ¬∃z(note⁡q(z,y) ∧ mother⁡(z,x)) ]

≡ for every x there is some y which is a mother of x and there does not exist some z which is not equivalent to y and mother of x

B.∀x∃y[mother(y,x)∧∀z(noteq(z,y)→¬mother(z,x))]

≡ for every x there is some y which is a mother of x and there is no z which is not equivalent to y and mother of x

EXACTLY means ATLEAST ONE and ATMOST ONE

Here all of the options guranteed ATLEAST ONE mother but only option B , D restricted the Mothers count to ATMOST ONE .

so option B,D are correct.

2 2 votes

The statement “Everyone has exactly one mother” requires that for every individual $x$, there exists a unique $y$ such that $\texttt{mother}(y,x)$ holds. This entails:

  • Existence: $\forall x \, \exists y \, \texttt{mother}(y,x)$
  • Uniqueness: $\forall x \, \forall y \, \forall z \, \bigl( \texttt{mother}(y,x) \land \texttt{mother}(z,x) \rightarrow y = z \bigr)$

 

Option A

$$
\forall x \, \exists y \, \exists z \, \bigl( \texttt{mother}(y,x) \land \lnot \texttt{mother}(z,x) \bigr)
$$

This formula is satisfied if, for every $x$, there is some mother and some non-mother. It does not prohibit multiple mothers.

To demonstrate its inadequacy, consider the following countermodel:

$$
\begin{array}{l}
\text{Domain: } \{p, m_1, m_2, r\} \\
\text{Motherhood facts: } \\
\quad \texttt{mother}(m_1, p) \\
\quad \texttt{mother}(m_2, p) \\
\quad \lnot \texttt{mother}(r, p)
\end{array}
$$

Here, $p$ has two distinct mothers, violating “exactly one”. However, for $x = p$, choose $y = m_1$ and $z = r$: $\texttt{mother}(m_1, p) \land \lnot \texttt{mother}(r, p)$ is true. Thus, the formula holds, even though the intended meaning is false. Hence, Option A is incorrect.

Option B

$$
\forall x \, \exists y \, \Bigl[ \texttt{mother}(y,x) \land \forall z \, \bigl( \texttt{noteq}(z,y) \rightarrow \lnot \texttt{mother}(z,x) \bigr) \Bigr]
$$

This asserts: for each $x$, there is a $y$ such that:

  • $y$ is a mother of $x$, and
  • every $z \ne y$ is not a mother of $x$.

This precisely captures existence and uniqueness.

Suppose, for contradiction, that some $p$ has two mothers $m_1 \ne m_2$. Then for $x = p$, no choice of $y$ can satisfy the condition:

  • If $y = m_1$, then for $z = m_2$, $\texttt{noteq}(m_2, m_1)$ is true but $\texttt{mother}(m_2, p)$ is also true, violating the implication.
  • Similarly for $y = m_2$.

Thus, the formula is false in any model with multiple mothers, and true only when each person has exactly one mother.Therefore, Option B is correct.

Option C

$$
\forall x \, \forall y \, \Bigl[ \texttt{mother}(y,x) \rightarrow \exists z \, \bigl( \texttt{mother}(z,x) \land \lnot \texttt{noteq}(z,y) \bigr) \Bigr]
$$

Note that $\lnot \texttt{noteq}(z,y)$ is equivalent to $z = y$. Hence, the consequent becomes:
$$
\exists z \, \bigl( \texttt{mother}(z,x) \land z = y \bigr) \equiv \texttt{mother}(y,x)
$$

Thus, the entire formula simplifies to:
$$
\forall x \, \forall y \, \bigl( \texttt{mother}(y,x) \rightarrow \texttt{mother}(y,x) \bigr)
$$
which is a tautology.

Counterexample 1 (no mother):  

  • Let the domain be $\{p\}$, and assume $\lnot \texttt{mother}(y,p)$ for all $y$. The implication is vacuously true for all $y$, so the formula holds — yet $p$ has no mother.

Counterexample 2 (two mothers):  

  • Let $\texttt{mother}(m_1,p)$ and $\texttt{mother}(m_2,p)$ with $m_1 \ne m_2$. For $y = m_1$, the consequent is satisfied by $z = m_1$; similarly for $y = m_2$. The formula holds despite the violation of uniqueness.

Hence, Option C is incorrect.

Option D

$$
\forall x \, \exists y \, \Bigl[ \texttt{mother}(y,x) \land \lnot \exists z \, \bigl( \texttt{noteq}(z,y) \land \texttt{mother}(z,x) \bigr) \Bigr]
$$

This states: for each $x$, there is a $y$ such that:

  • $y$ is a mother of $x$, and
  • there is no $z \ne y$ that is also a mother of $x$.

Using standard quantifier negation:
$$
\lnot \exists z \, \bigl( \texttt{noteq}(z,y) \land \texttt{mother}(z,x) \bigr)
\equiv
\forall z \, \bigl( \texttt{noteq}(z,y) \rightarrow \lnot \texttt{mother}(z,x) \bigr)
$$

Thus, Option D is logically equivalent to Option B.

In the countermodel where $p$ has two mothers $m_1 \ne m_2$, any candidate $y$ (say $m_1$) fails because $z = m_2$ satisfies $\texttt{noteq}(z,y) \land \texttt{mother}(z,x)$. Hence, the inner negation is false, and the formula does not hold as required.Therefore, Option D is correct.

$$
\color{lime} \boxed{\text{Options B and D are correct}}
$$

 

1 1 vote

Answer: B and D 

"Everyone has exactly one mother"

The meanings of the predicates used are:

  • mother (y,x): y is the mother of x
  • noteq (x,y): x and y are not equal

A. ∀x∃y∃z(mother⁡(y,x)∧¬mother⁡(z,x))

This translates into "For all x there exists a y and there exists a z such that y is the mother of x AND z is not the mother of x".

This is FALSE because both y and z can be the exact mother of x if z=y (z and y are the same person).

It would be TRUE if noteq(z,y) would have been used.

B. ∀x∃y[mother⁡(y,x)∧∀z(noteq⁡(z,y)→¬mother⁡(z,x))]

This translates into "For all x there exists a y such that y is the mother of x AND for all z if z is not equal to y then z is not the mother of x". 

This is TRUE and is the correction to Option A.

C. ∀x∀y[mother⁡(y,x)→∃z(mother⁡(z,x)∧¬note⁡q(z,y))]

This translates into "For all x and for all y such that if y is the mother of x then there exists a z such that z is the mother of x AND z is equal to y". 

This is False as it leads to the possibility of x having two mothers. 

How? If some y is mother of x and there is exists some other z that is also the mother of x. Then z cannot be equal to y. Thus, x can have either y as the mother OR z as the mother. This fails because of AND.

D. ∀x∃y[mother⁡(y,x)∧¬∃z(note⁡q(z,y)∧mother⁡(z,x))]

This translates into "For all x and there exists y such that y is the mother of x AND there does not exist a z such that z is not equal to y AND z is the mother of x".

This is True as if y is established as mother of x and z is not equal to y, then there is no z as mother of x.

• edited by
0 0 votes

Let mother(y,x)=yMx.
noteq(x,y)=x!=y.


OPTION A:

∀ x ∃ y ∃ z ( mother ( y , x ) ∧ ¬ mother ( z , x ) ) 

y and z have same domain , there exist will be always true if there is even single true value in domain. now if suppose for an instance n1, y took n1, and z also took n1. so option A will be (definetly)false .


OPTION B:
 

∀ x ∃ y [ mother ( y , x ) ∧ ∀ z ( noteq ( z , y ) → ¬ mother ( z , x ) ) ]

z!=y-->z!Mx <=> z=y V  z!Mx 

for every x there exist y [such that y is mother of x  and , for every y (z is same as y OR z is not the mother of x)]
by taking an instance n1 of a domain this xondition will satisfy for that unixe n1 , and not others at a time .
 


OPTION C :

∀ x ∀ y [ mother ( y , x ) → ∃ z ( mother ( z , x ) ∧ ¬ note q ( z , y ) ) ]

this is not satisfing uniqueness condition .
 


OPTION D:

 

∀ x ∃ y [ mother ( y , x ) ∧ ¬ ∃ z ( note q ( z , y ) ∧ mother ( z , x ) ) ]

This option is same as option B  , after simplification .


B,D true 

Answer:
Position:
Show:

Related questions

3 3 votes
1 1 answer
682
682 views
GO Classes asked May 12, 2022
682 views
Working with a unary predicate symbol, $P,$ a binary predicate symbol $Q$ and a unary function symbol $f,$ consider the following interpretation $M,$ given by,Universe $A...
4 4 votes
1 1 answer
665
665 views
GO Classes asked May 12, 2022
665 views
Recall that a "sentence/proposition" is a predicate logic formula that has no free variables.In predicate logic, a set of sentences is satisfiable iff there is some inter...