Re: Small set Theory:final version.




Jesse F. Hughes wrote:
"zuhair" <zaljohar@xxxxxxxxx> writes:

zuhair wrote:
I think ZFC can be translated to the following:

Premitives e

Definitions:

x is P_not embedded <-> Ay( yex<->P[y]).

Axioms:

1) Extensionality: As in ZFC.
2) Regularity: As in ZFC.
3) Comprehension: AP( (ExAy(yex<->P[y])) <-> ~P[x] )
were P is a predicate in one variable that doesn't use x,
nor it is biconditioned to a predicate in one variable that use x.

Once again, you have x free on the right hand side and bound on the
left. What a strange axiom!

ah, yea you are right,this is wrong then, in reality this is was not my
original idea.

correction:

3) Comprehension: AP( (ExAy(yex<->P[y])) <-> x is P_not embedded ).

Now it doesn't matter if x on the right of the biconditional is free,
since for every P there
is one and only one set that is defined after it.

However I know that even with this axiom , this theory though It
resembles ZFC. but it is not equivalent to it.

see that for example the set of all transitive sets which is not a
transitive set, is a set in this theory, while it is not in ZFC.

Zuhair

--
Jesse F. Hughes
"Radicals are interesting because they were considered 'radical' by
the people who played with them who wrote a lot of math work that
modern mathematics depends on." --Another JSH history lesson

.



Relevant Pages

  • Re: Simplifying M theories.
    ... Perhaps you mean the axioms relativized to the predicate 'set'. ... universe, so that S maps predicates of RA to subsets of R. ... ZFC Extensionality: ...
    (sci.logic)
  • Re: Lets you & him fight
    ... the first-order language of set theory a satisfaction predicate, ... theory, call it ZFC*, is not conservative over ZFC, it has much ... Thus, given we accept an inaccessible or something beyond ZFC, we can recognize the resulting theory as comprising exactly the principles that are acceptable on basis of acceptance of ZFC, similarly as RA_Gamma_0 - predicative analysis - comprises exactly the principles acceptable on basis of acceptance of the totality of natural numbers as determinate - so that arithmetical truth is a legitimate notion - and induction in the informal sense. ...
    (sci.logic)
  • Re: The set of All sets
    ... >No axioms of ZFC mention 'set'. ... One can define the predicate 'is a set' ... Herman Rubin, Department of Statistics, Purdue University ...
    (sci.math)
  • Re: Why cant such an example be given?
    ... No predicate can be proven to exist in ZFC, ... i am fully aware that ZFC is not a second order language ... i.e. it can be proven that thereExists S_P_O ...
    (sci.math)
  • Re: Small set Theory:final version.
    ... Extensionality: As in ZFC. ... Regularity: As in ZFC. ... nor it is biconditioned to a predicate in one variable that use x. ... "Radicals are interesting because they were considered 'radical' by ...
    (sci.math)