871 views
1 votes
1 votes

The notation $\exists ! x P(x)$ denotes the proposition “there exists a unique $x$ such that $P(x)$ is true”. Give the truth values of the following statements : 

I)${\color{Red} {\exists ! x P(x)}} \rightarrow \exists x P(x)$

II)${\color{Red} {\exists ! x\sim P(x)}} \rightarrow \neg \forall x P(x)$


What will be answer here?? Is the assumption only for left hand side and not right hand side??

1 Answer

1 votes
1 votes

Let $P(x):(x-1=0)$ defined over $\mathbb{Z}^{+}$

then $x=1$ is the only unique solution for which $P(x)$ is true.

 

  $\exists !xP(x)$ means " there exists a unique $x$ such that $P(x)$ is true” and here the unique value of $x=1$

$\Rightarrow$ We can say that there exist a value of $x$ for which proposition holds true.

$\Rightarrow$ $\exists xP(x)$

So if  there exists a unique $x$ such that $P(x)$ is true then there will exist atleast $1$ value of $x$ for which proposition holds true.

$\therefore$ $\exists !xP(x)\rightarrow\exists xP(x)$ is true.


Let $P(x):(5/x$ is defined $)$ defined over $\mathbb{R}^{+}$

then $x=0$ is the only unique solution for which $P(x)$ is false since $5/0$ is undefined.

 

$\exists !x\sim P(x)$ means there exists a unique $x$ such that $P(x)$ is not true i.e. $P(x)$ is false and here the unique value is $x=0$

$\sim \forall xP(x)$ can also be written as $\exists x\sim P(x)$ which means there exists at least one $x$ such that $P(x)$ is not true i.e. $P(x)$ is false and here we are having x=0 which is satisfying.

So if there exists a unique $x$ such that $P(x)$ is not true i.e. $P(x)$ is false then there will definitely  exists at least one $x$ such that $P(x)$ is not true i.e. $P(x)$ is false

$\Rightarrow$  $\exists !x\sim P(x)\rightarrow\sim \forall xP(x)$ is true.

Related questions

4 votes
4 votes
1 answer
1
Utk asked Jan 14, 2016
709 views
Which predicate logic means, "There are at most two men in class"?$\forall x\forall y((Male(x)\wedge Male(y))\rightarrow (x=y \vee y=x)$$\exists x \exists y (Male(x)\wedg...
3 votes
3 votes
1 answer
3
srestha asked Jun 4, 2019
990 views
“Not every satisfiable logic is valid” Representation of it will be $1)\sim \left ( \forall S(x)\rightarrow V(x) \right )$or$2)\sim \left ( \forall S(x)\vee V(x) \rig...
1 votes
1 votes
0 answers
4