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.

37P.J. Cohen proved that if ZF is c<strong>on</strong>sistent then so is ZF + ¬AxC and ZFC +¬CH, thus complementing Gödel’s results. See (Cohen 1963-1964). The pro<strong>of</strong>does not readily give an interpretati<strong>on</strong> <strong>of</strong> ZF + ¬AxC, or <strong>of</strong> ZFC + ¬CH in ZF. Itcan be c<strong>on</strong>verted into such an interpretati<strong>on</strong> by a general method whereby undercertain c<strong>on</strong>diti<strong>on</strong>s (met here), if the c<strong>on</strong>sistency <strong>of</strong> every given finite subsystem <strong>of</strong><strong>on</strong>e system is provable in another, then the first system is interpretable in theother (see (Feferman 1960)).Again, the questi<strong>on</strong> arises as to how simple can an interpretati<strong>on</strong> be <strong>of</strong> ZF+ ¬AxC or <strong>of</strong> ZFC + ¬CH, in ZF, with abbreviati<strong>on</strong>s allowed in the presentati<strong>on</strong><strong>of</strong> the interpretati<strong>on</strong>? Again t<strong>his</strong> is far from clear. And how does t<strong>his</strong> questi<strong>on</strong>compare with the previous questi<strong>on</strong>?There is another kind <strong>of</strong> complexity issue associated with the CH that is <strong>of</strong>interest. First some background. It is known that every 3 quantifier sentence inprimitive notati<strong>on</strong> ∈,=, is decided in a weak fragment <strong>of</strong> ZF. See (Gogol 1979),(Friedman 2003a). Also there is a 5 quantifier sentence in ∈,= that is not decidedin ZFC (it is equivalent to the existence <strong>of</strong> a subtle cardinal over ZFC). See(Friedman 2003b). It is also known that AxC can be written with five quantifiersin ∈,=, over ZFC. See (Maes 2007).The questi<strong>on</strong> is: how many quantifiers are needed to express CH overZFC, in ∈,=? We can also ask t<strong>his</strong> and related questi<strong>on</strong>s where abbreviati<strong>on</strong>s areallowed.Most mathematicians instinctively take the view that since CH is neitherprovable nor refutable from the standard axioms for mathematics (ZFC), theultimate status <strong>of</strong> CH has been settled and there is nothing left to p<strong>on</strong>der.

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

Saved successfully!

Ooh no, something went wrong!