[FOM] Arithmetical soundness of ZFC
Timothy Y. Chow
tchow at alum.mit.edu
Sun May 24 13:50:22 EDT 2009
Harvey Friedman <friedman at math.ohio-state.edu> wrote:
> WHAT WOULD EVIDENCE OF THE NON ARITHMETICAL SOUNDNESS OF ZFC LOOK LIKE?
One example would be a proof of "ZFC is inconsistent" in ZFC.
Actually, what I think is more interesting is Nik Weaver's implicit
suggestion that a random sentence in the first-order language of
arithmetic is undecidable in PA. Is there any way to make this precise?
More information about the FOM