[FOM] Simple and difficult

[Joe Shipman]

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?

-- JS

Sent from my iPhone
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20130402/62128037/attachment-0001.html>