Thread: Universal senteces & bound variables

1. Universal senteces & bound variables

Hi,
Does the fact that a sentence is an universal sentence (i.e. x+y=y+z) automatically make all variables bound?
Let me give you an example. In the expression "for any x, x-y=x+(-y)" is only an x variable bound or both x & y are bound variables?

MY doubt is due to the convention that in many universal sentences the quantifiers are customarily dropped.

Thanks
BTW the above question is from A Tarski "Intro to logic..."

2. Re: Universal senteces & bound variables

Originally Posted by mathphile
In the expression "for any x, x-y=x+(-y)" is only an x variable bound or both x & y are bound variables?
All instances of x are bound and no instances of y are bound.

Originally Posted by mathphile
the convention that in many universal sentences the quantifiers are customarily dropped.
In many contexts, we often leave off the universal quantifiers. If you wish to know whether an instance of a variable is bound or not in a formula, then just specify whether you mean the formula as it is actually displayed or as it is, in some context, understood to stand for the universal closure of the displayed formula.

If "for all x, x-y=x+(-y)" is to be regarded as actually displayed, then no instances of y are bound in it.

If "for all x, x-y=x+(-y)" is to be regarded as standing for its universal closure "for all y, for all x, x-y=x+(-y)" then all instances of y are bound in it.

Note that the key theorem of logic for this matter is:

For all formulas F we have |- F if and only if |- AxF. But it is not the case that for all formulas F we have |- F <-> AxF.

3. Re: Universal senteces & bound variables

Thanks,

Originally Posted by MoeBlee

Note that the key theorem of logic for this matter is:

For all formulas F we have |- F if and only if |- AxF. But it is not the case that for all formulas F we have |- F <-> AxF.
Sorry, I'm pretty new to math & logic -- can you tell me how to read the theorem (symbols).
Thanks
mathphile

4. Re: Universal senteces & bound variables

'|-' stands for 'is a theorem'.

For all formulas F, we have that F is a theorem if and only if AxF is a theorem.

But it it not the case that for all formulas F, we have that F <-> AxF is a theorem. ('<->' is the if and only if symbol).

5. Re: Universal senteces & bound variables

Many thanks,
I must be pain in the neck, but could you explain what AxF mean?

6. Re: Universal senteces & bound variables

You're not a pain. I was using 'A' for the universal quantifier "for all".

7. Re: Universal senteces & bound variables

Thanks. I've learned something.