Re: If ZFC is incomplete it can not prove anything

On Apr 26, 10:22 pm, "elsiemelsi" <cyprin...@xxxxxxxxxxxxxxx> wrote:

i say crap
ZFC has true statements which cant be proven

No, it doesn't.
EVERY statement in the relevant first-order language
has the property that IF it cannot be proven from the axioms
of ZFC, then there is SOME model of ZFC -- of those axioms --
where the statement IS FALSE. So it is simply NOT the case
that ZFC "has true statements". ZFC is A FORMAL THEORY.
So it has PROVABLE statements, or decidable statements,
AND UNdecidable statements. True and false DON'T EVEN
ENTER INTO IT. Of course, if you have been arguing with
the ghost of Torkel Franzen, some of your confusion is excusable.

.

Relevant Pages