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.independent

Topic: A reformulation of MK-Foundation-Choice: Even more compact!
Replies: 3   Last Post: Mar 28, 2013 2:25 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Zaljohar@gmail.com

Posts: 2,665
Registered: 6/29/07
A reformulation of MK-Foundation-Choice: Even more compact!
Posted: Mar 23, 2013 1:33 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

This is even more compact reformulation of MK-Foundation-Choice.

Unique Comprehension: if phi is a formula in which x is not free,
then:
(Exist x for all y (y in x iff set(y) & phi)) is an axiom.

Size limitation: Set({}) & [Set(x) & y =< H(TC(x)) -> Set(y)]
/

Def.) y C x iff for all z (z in y -> z in x)
Def.) y =< x iff y C x Or Exist f (f:y-->x & f is injective)
Def.) TC(x)= {y| for all t. t is transitive & x C t -> y in t}
Def.) t is transitive iff for all m,n(m in n & n in t -> m in t)
Def.) H(x)={y| for all z. z in TC(y) or z=y -> z =< x}

It is nice to see that only one axiom can prove the existence of all
sets in ZF.
So Pairing, Union, Power, Infinity, Separation and Replacement All are
provable over sets. Of course Foundation and Choice are interpretable
in this theory.
Con(ZFC) is actually Provable in this theory.

Zuhair



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

[Privacy Policy] [Terms of Use]

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