[FOM] Falsify Platonism?

Brian Hart hart.bri at gmail.com
Thu Apr 22 18:20:36 EDT 2010

One way to falsify set-theoretical Platonism might be by demonstrating
that CH does not posess a truth value since it is a presumption of
Platonism in general that all mathematical statements possess such a

On Wed, Apr 21, 2010 at 10:34 PM, Bill Taylor
<W.Taylor at math.canterbury.ac.nz> wrote:
> 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?
> Yes.
> 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)
> _______________________________________________
> FOM mailing list
> FOM at cs.nyu.edu
> http://www.cs.nyu.edu/mailman/listinfo/fom

More information about the FOM mailing list