"

On the values of variables

For a moment, let’s forget about our logics and consider everyday mathematical practice. Suppose you have a simple equation of one unknown variable as follows: (2×x)+7=57(2\times x)+7=57 If you ‘solve’ this equation, you get that x=25x=25. Now really, all this means is that if you take the value of the variable xx to be 2525, then (2×x)+7=57(2\times x)+7=57 will come out correct, while if you take the value of the variable xx to be anything else, it will come out incorrect. Thus, one way we can talk about variables is to assign them a value and see whether the resulting formula is correct, computing with the value assigned. In such cases, the variables function like temporary constants. Essentially, what we are saying above is that for a moment, you should understand (2×x)+7=57(2\times x)+7=57 the same way as you would understand (2×25)+7=57(2 \times 25) + 7= 57. Of course, unlike with constants, what the value of xx is is temporarily assigned. For example, in (5×x)+7=107(5 \times x)+7=107, the formula will now come out true provided xx is assigned the value 2020, not 2525. Clearly, the value of 2020 and 2525 did not change from one equation to the other, but the assigned value of xx did, provided the aim is to make the formula correct. And of course, we can assign a value to xx that makes neither of these equations come out correct. For example, if xx is assigned the value 9797, both equations will come out incorrect. As we shall see presently, our semantics for first-order logic will be founded on these temporary assignments of values to the variables of the language 1\mathcal{L}_1.

Ultimately, our goal is to assign meaning to quantified formulas with no free variables, i.e., quantified closed formulas, in a systematic way. This will be based on a generalization of the idea of temporary assignments of values. For example, take the claim:

The equation (2×x)+7=57(2\times x)+7=57 has a solution.

What this means is that there is a temporary assignment of a value to the variable xx such that (2×x)+7=57(2\times x)+7=57 comes out correct. This is clearly a use of the existential quantifier. And clearly, this is true if there really is such an assignment. Moreover, as demonstrated, there is such an assignment (assigning 2525 to xx), so it is true that the equation has a solution.

On the other hand, take the claim:

The equation (0×x)+7=57(0\times x)+7=57 has a solution.

This is false, and the reason why it is false is because there is no assignment of a value to the variable xx such that (0×x)+7=57(0\times x)+7=57.

The same type of reasoning holds for the universal quantifier. For example, for the equation 2×(x+2)=(2×x)+42 \times (x + 2)=(2 \times x) + 4, every temporary assignment of a value to the variable xx makes the equation come out correct. Incidentally, this is equivalent to the fact that there is no assignment of a value to the variable xx which would make the equation come out incorrect.

License

Icon for the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Learning Logic Backwards Copyright © by Peter Susanszky is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License, except where otherwise noted.