Truth-value realism about (first-order) arithmetic is the thesis that for any first-order logic sentence in the language of arithmetic (i.e., using the successor, addition and multiplication functions along with the name “0”), there is a definite truth value, either true or false.
Now, consider the following argument for truth-value realism about arithmetic.
Assume eternalism.
Imagine a world with an infinite space and infinite future that contains an ever-growing list of mathematical equations.
At the beginning the equation “S0 = 1” is written down.
Then a machine begins an endless cycle of alternation between three operations:
Scan the equations already written down, and find the smallest numeral n that occurs in the list but does not occur in an equation that starts with “Sn=”. Then add to the bottom of the list the equation “Sn = m” where m is the numeral coming after n.
Scan the equations already written down, and find the smallest pair of numerals n, m (ordered lexicographically) such that n + m= does not occur in the list of equations, and write at the bottom of the list n + m = r where r is the numeral representing the sum of the numbers represented by n and m.
Scan the equations already written down, and find the smallest pair of numerals n, m (ordered lexicographically) such that n ⋅ m= does not occur in the list of equations, and write at the bottom of the list n ⋅ m = r where r is the numeral representing the product of the numbers represented by n and m.
No other numerals are ever written down in that world, and no equations disappear from the list. We assume that all tokens of a given numeral count as “alike” and no tokens of different numerals count as “alike”. The procedure of producing numerals representing sums and products of numbers represented by numerals can be given entirely mechanically.
Now, if ϕ is an arithmetical sentence, then we say that ϕ is true provided that ϕ would be true in a world such as above under the following interpretation of its basic terms:
The domain consists of the first occuring token numerals in the giant list of equations (i.e., a token numeral in the list of equations is in the domain if and only if no token alike to it occurs earlier in the list).
0 refers to the zero token in the first equation.
The value of Sn for a token numeral n is the token in the domain alike to a token appearing after the equal sign in an equation whose left-side consists of a capital S token followed by a token alike to n.
The value of n + m for token numerals n and m is the token in the domain alike to a token appearing after the equal sign in an equation whose left-side consists of a token alike to n follow by a plus sign followed by a token alike to m.
The value of n ⋅ m for token numerals n and m is the token in the domain alike to a token appearing after the equal sign in an equation whose left-side consists of a token alike to n follow by a multiplication sign followed by a token alike to m.
It seems we now have well-defined truth-value assignments to all arithmetical sentences. Moreover, it is plausible that these assignments would be correct and hence truth-value realism about arithmetic is correct.
But there is one serious hole in this argument. What if there are two worlds w1 and w2 with lists of equations both of which satisfy my description above, but ϕ gets different truth values in them? This is difficult to wrap one’s mind around initially, but we can make the worry concrete as follows: What if the two worlds have different lengths of “infinite future”, so that if we were to line up the lists of equations of the two worlds, with equal heights of lines, one of the two lists would have an equation that comes after all of the equations of the other list?
This may seem an absurd worry. But it’s not. What I’ve just said in the worry can be coherently mathematically described (just take a non-standard model of arithmetic and imagine the equations in one of the lists to have the order-type of that model).
We need a way to rule out such a hypothesis. To do that, what we need is a privileged notion of the finite, so that we can specify that for each equation in the list there is only a finite number of equations before it, or (equivalently) that for each operation of the list-making machine, there are only finitely many operations.
I think there are two options here: a notion of the finite based on the arrangement of stuff in our universe and a metaphysically privileged notion of the finite.
There are multiple ways to try to realize the first option. For instance, we might say that a finite sequence is one that would fit in the future of our universe with each item in the sequence being realized on a different day and there being a day that comes after the whole sequence. (Or, less attractively, we can try to use space.) One may worry about having to make an empirical presupposition that the universe’s future is infinite, but perhaps this isn’t so bad (and we have some scientific reason for it). Or, more directly in the context of the above argument, we can suppose that the list-making machine functions in a universe whose future is like our world’s future.
But I think this option only yields what one might call “realism lite”. For all we’ve said, there is a possible world whose future days have the order structure of a non-standard model of arithmetic, and the analogue to the mathematicians of our world who employed the same approach as we just did to fix the notion of the finite end up with a different, “more expansive”, notion of the finite, and a different arithmetic. Thus while we can rigidify our universe’s “finite” and or the length of our universe’s future and use that to fix arithmetic, there is nothing privileged about this, except in relation to the actual world. We have simply rigidified the contingent, and the necessity of arithmetical truths is just like the necessity of “Water is H2O”—the denial is metaphysically impossible but conceivable in the two-dimensionalist sematics sense. And I feel that better than this is needed for arithmetic.
So, I think we need a metaphysically privileged notion of the finite to make the above argument go. Various finitism provide such a notion. For instance, finitism simpliciter (necessarily, there are only finitely many things), finitism about the past (necessarily, there are always only finitely many past items), causal finitism (necessarily, each item has only finitely many causal antecedents), and compositional finitism (necessarily, each item has at most finitely many parts). Finitism simpliciter, while giving a notion of the finite, doesn’t work with my argument, since my argument requires eternalism, an infinite future and an ever-growing list. Finitism about the past is an option, though it has the disadvantage that it requires time to be discrete.
I think causal finitism is the best option for what to plug into the argument, but even if it’s the best option, it’s not a dialectically good option, because it’s more controversial than the truth-value realism about arithmetic that is the conclusion of the argument.
Alas.
No comments:
Post a Comment