[FOM] Simple and difficult
JoeShipman at aol.com
Tue Apr 2 23:13:21 EDT 2013
It's easy to write down a sentence in the language of Peano Arithmetic which is both short and unsettled:
AxEyAzAw (x<y & ~(SSzSSw=y V SSzSSw=SSy))
What's the shortest or simplest sentence you can come up with in the language of set theory that is either (1) not settled (2) provably not a theorem of ZFC if ZFC is consistent?
Sent from my iPhone
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the FOM