[FOM] Falsify Platonism?

Monroe Eskew meskew at math.uci.edu
Sat Apr 24 03:15:53 EDT 2010


Ah but you can get the Platonist (or Hilbert) to specify the logic
s/he is using.  I've never met a Platonist who does not accept
classical logic.  Such a thing would be quite curious!

Monroe

On Thu, Apr 22, 2010 at 4:37 PM, Nick Nielsen <john.n.nielsen at gmail.com> wrote:
> Doesn't this depend upon the logic used to derive the contradiction,
> and whether one is a dialetheist or not?
>
> Does a recognition of the possibility of alternative logics (including
> paraconsistent logics) employed to derive contradictions soften the
> hard tests to which Hilbert's program has been exposed?
>
> Best wishes,
>
> Nick Nielsen
>
>
>> 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?
>
> And then Bill Taylor <W.Taylor at math.canterbury.ac.nz> wrote:
>
>> 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