Decius comments on Logical Pinpointing - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (338)
In that case, P(o) is true, and P(k)->P(Pk) is equally provable.
No...?
The above basically says that
P(k)is "is within the successor chain of 0". Note that the base case isk = 0, notk = o. Anyway, the point is, since such a property is possible (including only the objects that are some n-successor of 0), the axiom of induction implies that numbers that follow 0 are the only numbers.ETA: Reading your parent post again, the problem is it's impossible to have an
othat has every property0does. As a demonstration,Z(k) := (k = 0)is a valid property. It's true only of0.R(k, 0)is similarly a property that is only true of0, orSS..0.