home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.physics:14696 sci.math:11493
- Newsgroups: sci.physics,sci.math
- Path: sparky!uunet!gatech!news.byu.edu!ux1!mica.inel.gov!guinness!opal.idbsu.edu!holmes
- From: holmes@opal.idbsu.edu (Randall Holmes)
- Subject: Re: Report on Philosophies of Physicists
- Message-ID: <1992Sep15.183814.6870@guinness.idbsu.edu>
- Sender: usenet@guinness.idbsu.edu (Usenet News mail)
- Nntp-Posting-Host: opal
- Organization: Boise State University Math Dept.
- References: <TORKEL.92Sep13095337@bast.sics.se> <1992Sep13.174721.23818@CSD-NewsHost.Stanford.EDU> <1992Sep14.191207.21572@guinness.idbsu.edu>
- Date: Tue, 15 Sep 1992 18:38:14 GMT
- Lines: 55
-
- In article <1992Sep14.191207.21572@guinness.idbsu.edu> holmes@opal.idbsu.edu (Randall Holmes) writes:
- >In article <1992Sep13.174721.23818@CSD-NewsHost.Stanford.EDU> pratt@Sunburn.Stanford.EDU (Vaughan R. Pratt) writes:
- >>In article <TORKEL.92Sep13095337@bast.sics.se> torkel@sics.se (Torkel Franzen) writes:
- >>>In article <1992Sep13.050206.18067@CSD-NewsHost.Stanford.EDU> pratt@Sunburn.
- >>>Stanford.EDU (Vaughan R. Pratt) writes:
- >>>
- [...]
- >>To make this yet more concrete, Harvey Friedman (and there may be
- >>others I don't know about) has for a long time been investigating the
- >>mathematical content of not-#, to see whether it is equivalent to a
- >>nice statement (which would make # similarly nice since the class of
- >>nice statements, whatever that is, is presumably closed under
- >>negation). He says that thus far he hasn't found anything really
- >>convincing for ZFC, though he has nice stuff off to the side, at ZC+V=L
- >>(Zermelo with Choice and Constructibility but without Fraenkel's
- >>Replacement).
- >>
- >>This seemingly quixotic quest is put in perspective by the celebrated
- >>Paris-Harrington result, that the infinite Ramsey theorem is
- >>independent of Peano Arithmetic. This was proved by showing that it
- >>was equivalent to (a slight strengthening of) not-# for PA, the
- >>consistency of Peano Arithmetic. The corresponding situation for ZFC
- >>is that, while various nice propositions are known to be independent of
- >>(i.e. undecided in) ZFC, none of these proofs to date have been via the
- >>route that succeeded for Paris-Harrington in PA. If a nice restatement
- >>of not-# exists then one immediately obtains that this nice statement
- >>is independent of ZFC, *via the independence of inconsistency* a la
- >>Paris-Harrington.
- >
- >This is flat wrong. # is false in the standard model of arithmetic
- >(in ZFC, if you like); the Paris-Harrington Theorem is true there.
- >Thus the PH theorem cannot be a strengthening of #.
-
- Sorry -- lost a negation there! This is fine. Of course, PH _can_ be
- (and is, if I recall correctly) a strengthening of not-# (Con(PA)).
-
- [...]
- >>--
- >>======================================================| God found the positive
- >>Vaughan Pratt pratt@cs.Stanford.EDU 415-494-2545 | integers, zero was
- >>======================================================| there when He arrived.
- >
- >
- >--
- >The opinions expressed | --Sincerely,
- >above are not the "official" | M. Randall Holmes
- >opinions of any person | Math. Dept., Boise State Univ.
- >or institution. | holmes@opal.idbsu.edu
-
-
- --
- The opinions expressed | --Sincerely,
- above are not the "official" | M. Randall Holmes
- opinions of any person | Math. Dept., Boise State Univ.
- or institution. | holmes@opal.idbsu.edu
-