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: A natural theory proving Con(ZFC)
Replies: 3   Last Post: Feb 11, 2013 12:25 PM

Advanced Search

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

Posts: 1,635
Registered: 2/27/06
Re: A natural theory proving Con(ZFC)
Posted: Feb 11, 2013 12:25 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Feb 8, 9:33 am, Zuhair <> wrote:
> On Feb 8, 4:27 pm, Frederick Williams <>
> wrote:

> > Zuhair wrote:
> > > I see the following theory a natural one that proves the consistency
> > > of ZFC.

> > > Language: FOL(=,in)
> > How do you express Con(ZFC) in that language?  I know one can encode it
> > using names of sets rather as one can encode Con(PA) using numerals, but
> > isn't it rather hard work and is your claim justified without at least
> > an outline?

> The language of this theory is the same language of ZFC. Consistency
> of ZFC would be proved by constructing a model of ZFC in this theory,
> the class of all well founded sets in this theory is a model of ZF and
> ZFC simply follows.

Who will bell the cat?


> Note: if one desires a direct way to prove choice and global choice,
> then the last axiom can be replaced by the following:
> Universal limitation: x strictly < W -> set(x).
> where "strictly <" refers < relation with absence of bijection, W is
> the universal class of all sets.
> Note: we can also use the ordinary relations defining subnumerousity
> after injections instead of surjections used here and this would also
> be enough to prove Con(ZFC).
> Zuhair

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.