Edinburgh Research Archive >
Philosophy, Psychology and Language Sciences, School of >
Philosophy research publications >
Please use this identifier to cite or link to this item:
|Title: ||Some More Curious Inferences|
|Authors: ||Ketland, Jeffrey|
|Issue Date: ||2005|
|Citation: ||Analysis 65/1, 18-24.|
|Abstract: ||The following inference is valid:
There are exactly 101 dalmatians,
There are exactly 100 food bowls,
Each dalmatian uses exactly one food bowl
Hence, at least two dalmatians use the same food bowl.
Here, “there are at least 101 dalmatians” is nominalized as,
"x1"x2…."x100$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ x100)
and “there are exactly 101 dalmatians” is nominalized as,
"x1"x2…."x100$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ x100) & Ø"x1"x2…."x101$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ x101).
This is abbreviated $101xDx.
The validity of the above inference corresponds to the valid formula,
PHP(100): [$101xDx & $100xFx & "x(Dx ® Ff(x))] ® $x1$x2(Dx1 & Dx2 & x1 ¹ x2 & f(x1) = f(x2)).
More generally, for variable n, the formula PHP(n) is
PHP(n): [$n+1xDx & $nxFx & "x(Dx ® Ff(x))] ® $x1$x2(Dx1 & Dx2 & x1 ¹ x2 & f(x1) = f(x2)).
A mathematical proof that PHP(n) is valid, for all n > 0, is quite short (less than a page), but refers to numbers, functions and sets. It uses the Pigeonhole Principle. This explains why PHP(n) is valid, for all n>0.
However, I estimate that a predicate calculus derivation of PHP(100), using natural deduction, say, would require around 107 symbols.
Unfeasibility Problem: nominalism is the radical anti-realist view that there are no numbers, functions or sets. So, how could a nominalist know that PHP(100) is valid, without directly performing the rather long derivation? Can the nominalist “ride piggyback” on the standard mathematical proof? If so, how is this justified?|
philosophy of mathematics
|Appears in Collections:||Philosophy research publications|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.