Heller M, Woodin W.H. (eds.) Infinity. New research frontiers (CUP, 2011)(ISBN 1107003873)(O)(327s)_MAml_
Heller M, Woodin W.H. (eds.) Infinity. New research frontiers (CUP, 2011)(ISBN 1107003873)(O)(327s)_MAml_ Heller M, Woodin W.H. (eds.) Infinity. New research frontiers (CUP, 2011)(ISBN 1107003873)(O)(327s)_MAml_
the realm of the finite 93By the usual arguments, it follows (within our universe of sets) that the theory ZFC 0does not prove 0 and ZFC 0 does not prove (¬ 0 ); i.e., the sentence 0 is independentof the theory ZFC 0 . I give the argument.For trivial reasons, ZFC 0 cannot prove 0 . This is becauseand clearly({∅} , ∈) ZFC 0({∅} , ∈) (¬ 0 )because ∅ is not a formal proof. Therefore, I have only to show thatAssume toward a contradiction thatZFC 0 ⊬ (¬ 0 ).ZFC 0 ⊢ (¬ 0 ).Then for all sufficiently large finite ordinals, n,(V n , ∈) “ZFC 0 ⊢ (¬ 0 ),”and so (V n , ∈) 0 . But for all finite ordinals n>0, (V n , ∈) ZFC 0 , and so(V n , ∈) (¬ 0 ),which is a contradiction.The sentence 0 is too pathological even for my purposes; a proof of (¬ 0 ) cannotbelong to a model of ZFC 0 with any extent beyond the proof itself. The sentence I seekis obtained by a simple modification of 0 that yields the sentence .Informally, the sentence asserts that there is a proof from ZFC 0 of (¬) of lengthless than 10 24 and further that V n exists where n =|V 1000 |. As I have already indicated,the choice of 10 24 is only for practical reasons. There is no corresponding reason formy particular choice of n; one could quite easily modify the definition by requiringthat the choice of n be larger.The formal specification of is a completely standard (although tedious) exerciseusing the modern theory of formal mathematical logic; this involves the formal notionof proof defined so that proofs are finite sequences of natural numbers, and so forth(Woodin 1998).In our universe of sets (¬) is true, so there is a proof of (¬) from ZFC 0 .Itisnotclear just how short such a proof can be. This is a very interesting question. The witnessfor Armageddon (although with the end of time comfortably distant in the future) is aproof of (¬) from ZFC 0 of length less than 10 24 .It is important to emphasize that while ZFC 0 is a very weak theory, in attemptingto prove (¬) from ZFC 0 , one is free to augment ZFC 0 with the axiom that V n existswhere n =|V 1000 |. This theory is not weak, particularly as far as the structure of binarysequences of length 10 24 or even of length 10 1010 is concerned.The sum total of human experience in mathematics to date (i.e., the number ofmanuscript pages written to date) is certainly less than 10 12 pages. The shortest prooffrom ZFC 0 that no such sequence exists must have length greater than 10 24 . This isarguably beyond the reach of our current experience, but there is an important issue
- Page 164: geometry, infinity, and the peano c
- Page 168: a success of set theory 69A fundame
- Page 172: the turing machine and the busy bea
- Page 176: the infinite in the finite: p versu
- Page 180: eferences 75Gamow, G. 1947. One, Tw
- Page 184: possible collapse of contemporary m
- Page 188: possible collapse of contemporary m
- Page 192: possible collapse of contemporary m
- Page 196: possible collapse of contemporary m
- Page 200: possible collapse of contemporary m
- Page 208: CHAPTER 4The Realm of the InfiniteW
- Page 212: the realm of the finite 91Now the c
- Page 218: 94 the realm of the infinitethat co
- Page 222: 96 the realm of the infinitefor whi
- Page 226: 98 the realm of the infiniteThis mu
- Page 230: 100 the realm of the infiniteMoreov
- Page 234: 102 the realm of the infiniteThis t
- Page 238: 104 the realm of the infinitesets)
- Page 242: 106 the realm of the infinite4.4.1
- Page 246: 108 the realm of the infiniteBut on
- Page 250: 110 the realm of the infiniteTheore
- Page 254: 112 the realm of the infiniteThis a
- Page 258: 114 the realm of the infiniteThe de
- Page 262: 116 the realm of the infiniteSuppos
the realm of the finite 93By the usual arguments, it follows (within our universe of sets) that the theory ZFC 0does not prove 0 and ZFC 0 does not prove (¬ 0 ); i.e., the sentence 0 is independentof the theory ZFC 0 . I give the argument.For trivial reasons, ZFC 0 cannot prove 0 . This is becauseand clearly({∅} , ∈) ZFC 0({∅} , ∈) (¬ 0 )because ∅ is not a formal proof. Therefore, I have only to show thatAssume toward a contradiction thatZFC 0 ⊬ (¬ 0 ).ZFC 0 ⊢ (¬ 0 ).Then for all sufficiently large finite ordinals, n,(V n , ∈) “ZFC 0 ⊢ (¬ 0 ),”and so (V n , ∈) 0 . But for all finite ordinals n>0, (V n , ∈) ZFC 0 , and so(V n , ∈) (¬ 0 ),which is a contradiction.The sentence 0 is too pathological even for my purposes; a proof of (¬ 0 ) cannotbelong to a model of ZFC 0 with any extent beyond the proof itself. The sentence I seekis obtained by a simple modification of 0 that yields the sentence .Informally, the sentence asserts that there is a proof from ZFC 0 of (¬) of lengthless than 10 24 and further that V n exists where n =|V 1000 |. As I have already indicated,the choice of 10 24 is only for practical reasons. There is no corresponding reason formy particular choice of n; one could quite easily modify the definition by requiringthat the choice of n be larger.The formal specification of is a completely standard (although tedious) exerciseusing the modern theory of formal mathematical logic; this involves the formal notionof proof defined so that proofs are finite sequences of natural numbers, and so forth(<strong>Woodin</strong> 1998).In our universe of sets (¬) is true, so there is a proof of (¬) from ZFC 0 .Itisnotclear just how short such a proof can be. This is a very interesting question. The witnessfor Armageddon (although with the end of time comfortably distant in the future) is aproof of (¬) from ZFC 0 of length less than 10 24 .It is important to emphasize that while ZFC 0 is a very weak theory, in attemptingto prove (¬) from ZFC 0 , one is free to augment ZFC 0 with the axiom that V n existswhere n =|V 1000 |. This theory is not weak, particularly as far as the structure of binarysequences of length 10 24 or even of length 10 1010 is concerned.The sum total of human experience in mathematics to date (i.e., the number ofmanuscript pages written to date) is certainly less than 10 12 pages. The shortest prooffrom ZFC 0 that no such sequence exists must have length greater than 10 24 . This isarguably beyond the reach of our current experience, but there is an important issue