The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Goedel Completeness Theorem
Replies: 4   Last Post: Dec 29, 2009 9:35 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 351
Registered: 10/27/06
Re: Goedel Completeness Theorem
Posted: Dec 26, 2009 10:29 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Dec 26, 3:42 pm, "" <> wrote:
> I am reading "Set Theory and the Continuum Hypothesis" by Paul Cohen.
> In it he states the Goedel Completeness Theorem:
> Let S be any consistent set of statements.  Then there exists a model
> for S whose cardinality does not exceed the cardinality of the number
> of statements in S if S is infinite and, and is countable if S is
> finite.
> The version of the theorem from the Stanford Encyclopedia of
> Philosophy states:
> Every valid logical expression is provable.
> Are these equivalent statements?
> Thanks,
> Gabriel Read

yes and no

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.