# logical quantification

• Nov 25th 2009, 04:56 AM
bmp05
logical quantification
Hello everyone,
I'm having problems with the following type of tutorial questions (yes, there are more of them):

Use logic notation to express the following:
"There is at most one x with P(x)"

I understand that to mean, "if there exists an x such that P(x), then for all other x not P(x)."

$
(\exists x)[P(x)] \rightarrow (\forall y)[\neg P(x)], x \neq y
$

but this is wrong, or at least badly expressed. Would the following be right?

$
(\exists x, \forall y; x \neq y)[P(x)]
$
• Nov 25th 2009, 04:59 AM
apcalculus
Quote:

Originally Posted by bmp05
Hello everyone,
I'm having problems with the following type of tutorial questions (yes, there are more of them):

Use logic notation to express the following:
"There is at most one x with P(x)"

I understand that to mean, "if there exists an x such that P(x), then for all other x not P(x)."

$
(\exists x)[P(x)] \rightarrow (\forall y)[\neg P(x)], x \neq y
$

but this is wrong, or at least badly expressed. Would the following be right?

$
(\exists x, \forall y; x \neq y)[P(x)]
$

Hmm... I would have expressed this as a conditional. If there two x-values x1 and x2 such that P(x1) and P(x2), then x1 = x2. Does this make sense?
• Nov 25th 2009, 05:08 AM
bmp05
Thanks for the reply apcalculus, that was a good explanation.

so you mean something like:

$
(\exists x,y)[(P(x) \leftrightarrow P(y)) \rightarrow (x = y)]
$

can you write this as follows?

$
(\exists x,y; x=y)[P(x) \leftrightarrow P(y)]
$
• Nov 25th 2009, 05:29 AM
emakarov
Apcalculus gave the right hint.

Translating sentences of the form "If there exists $x$ such that $P(x)$, then $Q(x)$" is a little counterintuitive. One could try

$\left(\exists x\,P(x)\right)\to Q(x)$

but this would not be right because the scope of $\exists x$ does not extend to $Q$. Another attempt is

$\exists x.\,(P(x)\to Q(x))$

This is also wrong because this proposition affirms the existence of something, while the original plain language sentence did not claim this.

The right way to translate "If there exists $x$ such that $P(x)$, then $Q(x)$" is using the universal quantifier:

$\forall x.\,(P(x)\to Q(x))$
• Nov 25th 2009, 05:42 AM
bmp05
That may well be, but you're making me cry!! (Crying)
• Nov 25th 2009, 05:47 AM
xalk
Quote:

Originally Posted by bmp05

I understand that to mean, "if there exists an x such that P(x), then for all other x not P(x)."

It is not a conditional and the right expression is:

There exist an x with P(x) and for all other x not P(x)
This in logic in quantifier form is expressed as follows:

$\exists xP(x)\wedge\forall x\forall y( P(x)\wedge P(y)\Longrightarrow x = y)$
• Nov 25th 2009, 05:50 AM
emakarov
Well, look: you need to translate the following statement.
Quote:

If there two x-values x1 and x2 such that P(x1) and P(x2), then x1 = x2
Instead of this, I'll translate a not-very-meaningful statement just to give an example:

If there is an $x$ such that $P(x)$ and $P(x)$, then $x=x$.

This would be

$\forall x.\,\big(P(x)\land P(x)\to x=x\big)$
• Nov 25th 2009, 05:54 AM
emakarov
Of course, to really solve the problem, besides writing the actual formula, you need to understand very well why
Quote:

If there two x-values x1 and x2 such that P(x1) and P(x2), then x1 = x2.
is equivalent to your original statement
Quote:

There is at most one x with P(x)
• Nov 25th 2009, 05:58 AM
xalk
Quote:

Originally Posted by emakarov
Well, look: you need to translate the following statement.
Instead of this, I'll translate a not-very-meaningful statement just to give an example:

If there is an $x$ such that $P(x)$ and $P(x)$, then $x=x$.

This would be

$\forall x.\,\big(P(x)\land P(x)\to x=x\big)$

Are you referring to my formula
• Nov 25th 2009, 06:04 AM
emakarov
Quote:

Originally Posted by xalk
Are you referring to my formula

No, I am referring to apcalculus's post.

I don't fully agree with your version.
Quote:

Originally Posted by xalk
It is not a conditional and the right expression is:

There exist an x with P(x) and for all other x not P(x)

The right expression of the original statement ("There is at most one...")? This is not correct because the original statement does not assert the existence of anything while your sentence does.

Quote:

This in logic in quantifier form is expressed as follows:

$\forall xP(x)\wedge\forall x\forall y( P(x)\wedge P(y)\Longrightarrow x = y)$
This is also strange because now instead of "There exist an x with P(x)" you write $\forall xP(x)$.
• Nov 25th 2009, 06:04 AM
bmp05
Quote:

Originally Posted by emakarov
Of course, to really solve the problem, besides writing the actual formula, you need to understand very well why
is equivalent to your original statement

Yes, I understand the reason. That makes sense, but the quantifiers and the logical operators do not make sense. The problem is the overloading of the x-variable. That hurts my head. It's the formula-writing which is the problem, not the problem itself.

I have to admit, I find this very hard. Thank you all for your help, nevertheless. (Happy)
• Nov 25th 2009, 06:13 AM
xalk
Quote:

Originally Posted by emakarov
No, I am referring to apcalculus's post.

I don't fully agree with your version.

The right expression of the original statement ("There is at most one...")? This is not correct because the original statement does not assert the existence of anything while your sentence does.

This is also strange because now instead of "There exist an x with P(x)" you write $\forall xP(x)$.

Yes thank a typo mistake,i corrected my post
• Nov 25th 2009, 11:47 AM
bmp05
Thanks emakarov, it took a while for this to sink in. Really. Anyway, thanks again.