🚀 go-pugleaf

In article <19216@ucbvax.BERKELEY.EDU> kube@cogsci.berkeley.edu.UUCP (Paul Kube) writes:
>The upshot of Goedel's incompleteness theorem is the unprovability of
>necessarily true statements, i.e., statements true in every model, for
>sufficiently powerful systems.  That there are *some* statements your
>system can't prove is a good thing: but this is the requirement of
>consistency, not completeness.  First order predicate calculus is both
>consistent and complete.

Perhaps; but let us understand that "sufficiently powerful systems" means
"second order systems" in this conclusion -- which is not at all the same as
the "sufficiently powerful" requirement for the systems to which the
incompleteness theorem itself applies to.

And even then, every unprovable statement is false in some model if you
fudge the definition of "model" a bit.
-- 

Frank Adams                           ihnp4!philabs!pwa-b!mmintl!franka
Ashton-Tate          52 Oakland Ave North         E. Hartford, CT 06108