Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

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

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

Topic: Paraphrasing MK
Replies: 1   Last Post: Nov 21, 2012 10:34 AM

Advanced Search

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

Posts: 2,665
Registered: 6/29/07
Paraphrasing MK
Posted: Nov 21, 2012 3:31 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Another way to present MK (which of course prove the consistency of
ZF) is the following:

Language: FOL(=,e)

Define: set(x) <-> Exist y. x e y

Axioms: ID axioms +

(1) Unique Construction: if P is a formula in which y occur free but x
do not, then
all closures of (Exist! x. for all y. y e x <-> set(y) & P) are

(2) Size: Accessible(x) -> set(x)

Where Accessible(x) is defined as:

Accessible(x) <-> (Exist maximally two m. m e x) OR
~ Exist y:
y subset of x &
y is uncountable &
y is a limit cardinal &
y is not reachable by union.

Def.) y is a limit cardinal <-> (for all y. y<x -> Exist z. y<z< x)
Def.) y is reachable by union <-> (Exist y. y < x & x =< U(y))

The relation < is "strict subnumerousity" defined in the usual manner.
The relation =< is subnumerousity defined in the usual manner.
"subset of" and "uncountable" also defined in the usual manner.
"Exist maximally two m. phi(m)" is defined as
Exist m,n for all y. phi(y) -> y=m or y=n
U(y) is the class union of y, defined in the customary manner.

So simply MK is about unique construction of accessible sets, and
proper classes of those.


Date Subject Author
Read Paraphrasing MK
Read Re: Paraphrasing MK

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

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2015. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.