12.07.2015 Views

my forty years on his shoulders - Department of Mathematics

my forty years on his shoulders - Department of Mathematics

my forty years on his shoulders - Department of Mathematics

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

36Lebesgue measurable” also satisfies CH in the str<strong>on</strong>g form that every set <strong>of</strong> realsis countable or has a perfect subset (t<strong>his</strong> str<strong>on</strong>g form is incompatible with AxC).See (Solovay 1970).The statement <strong>of</strong> CH is due to Cantor. Gödel also c<strong>on</strong>siders thegeneralized c<strong>on</strong>tinuum hypothesis, GCH, whose statement is credited toHausdorff. The GCH asserts that for all sets A, every subset <strong>of</strong> ℘(A) is either in<strong>on</strong>e-<strong>on</strong>e corresp<strong>on</strong>dence with a subset <strong>of</strong> A, or in <strong>on</strong>e-<strong>on</strong>e corresp<strong>on</strong>dence with℘(A). Here ℘ is the power set operati<strong>on</strong>.Gödel’s work establishes an interpretati<strong>on</strong> <strong>of</strong> ZFC + GCH in ZF. T<strong>his</strong>provides a very explicit way <strong>of</strong> c<strong>on</strong>verting any inc<strong>on</strong>sistency in ZFC + GCH to aninc<strong>on</strong>sistency in ZF.We can attempt to quantify these results. In particular, it is clear that theinterpretati<strong>on</strong> given by Gödel <strong>of</strong> ZFC + GCH in ZF, by relativizing to thec<strong>on</strong>structible sets, is rather large, in the sense that when fully formalized, resultsin a lot <strong>of</strong> symbols. It also seems to result in a lot <strong>of</strong> quantifiers. How many?So far we have been talking about the crudest formulati<strong>on</strong>s in primitivenotati<strong>on</strong>, without the benefit <strong>of</strong> abbreviati<strong>on</strong> mechanisms. But abbreviati<strong>on</strong>mechanisms are essential for the actual c<strong>on</strong>duct <strong>of</strong> mathematics. In fact, currentpro<strong>of</strong> assistants - where humans and computers interact to create verified pro<strong>of</strong>s- necessarily incorporate very substantial abbreviati<strong>on</strong> mechanisms. See, e.g.,(Barendregt, Wiedijk 2005), (Wiedijk 2006).So the questi<strong>on</strong> arises as to how simple can an interpretati<strong>on</strong> be <strong>of</strong> ZFC +GCH in ZF, with abbreviati<strong>on</strong>s allowed in the presentati<strong>on</strong> <strong>of</strong> the interpretati<strong>on</strong>?T<strong>his</strong> is far from clear.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!