[FOM] Falsify Platonism?

Bill Taylor W.Taylor at math.canterbury.ac.nz
Wed Apr 21 22:34:21 EDT 2010

Lucas Kruijswijk <L.B.Kruijswijk at inter.nl.net> wrote:

-> Hilbert's program contains hard tests, which are mostly
-> proven to be impossible. Is there any hard test that can
-> falsify Platonism?


If a contradiction is derived from PA, that will falsify Platonism.

(Strictly speaking, that falsifies numerical Platonism; it might be easier
 still to falsify set-theoretic Platonism.)
W. Taylor.    (Basics Bill)

More information about the FOM mailing list