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: How simple Z is?
Replies: 1   Last Post: Apr 23, 2013 11:10 PM

Advanced Search

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

Posts: 4,417
Registered: 5/20/10
Re: How simple Z is?
Posted: Apr 23, 2013 11:10 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Apr 24, 5:23 am, Zuhair <zaljo...@gmail.com> wrote:
> Pre-Z is the closure of all of what is provable from the logical
> axioms of first order logic and the following axioms by the rules of
> inference of first order logic (Hilbert style).
> Comprehension: if phi is a formula then a set {x C A| phi} exists.


ZFC Comprehension

A(Z) E(Y) A(X) XeY <-> XeZ & phi


E(Y) A(X) XeY <-> phi


ZFC breaks the above biconditional.


E(Y) A(X) XeY -> phi


Change <-> to ->
and you go from NST to ZFC.


Better still, use CBL where a WFF is TRUE XOR FALSE
then NST is consistent.


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.