If ZFC is incomplete it can not prove anything

the australian philosopher colin leslie dean points out that If ZFC is
incomplete it can not prove anything

If ZFC is consistent it is incomplete i.e it has statements which cannot
be proven true or false
thus


ZFC is used to prove things in mathematics
but
ZFC can only prove this if all its statement can be proven to be true
but
ZFC has statements which cannot be proven true or false
thus it cant prove anything

ZFC being undecidable cant be used to prove anything as it has statements
which cant be proven thus without those statements being proven these
statements cant prove anything


--
Message posted using http://www.talkaboutscience.com/group/sci.logic/
More information at http://www.talkaboutscience.com/faq.html

.

Relevant Pages

  • Re: If ZFC is incomplete it can not prove anything
    ... ZFC has true statements which cant be proven ... EVERY statement in the relevant first-order language ...
    (sci.logic)
  • Re: If ZFC is incomplete it can not prove anything
    ... that ZFC "has true statements". ... cant prove is axioms AND all of its theorems as TRUE because the system ... ZFC has statements which it cant prove as true ... thus the system ZFC cant prove a thing [you have admitted ZFC has true ...
    (sci.logic)
  • Re: Claim: We can assume ZFC consistent
    ... So what do you "believe", ZFC is incomplete, or con ... If its not complete, then it is consistent. ... the incompletenes proof of it is worthless ...
    (sci.logic)
  • Re: Uncountable sets in CZF?
    ... I see, ZFC is incomplete. ... > If in some extension, there does exist a bijection between the sets, ... A logical analogy would be that ...
    (sci.math)
  • Re: Uncountable sets in CZF?
    ... >> I see, ZFC is incomplete. ... confirms my sentiment that logic is incapable of talking about the ... Andrew Usher ...
    (sci.math)