「自由クラス理論」非標準集合論コミュの Free Class Theory It represents any Set Theory The shortest resume

１．　ＦＣ's Axiom

　　A. ma ∀X∀Y∀a∀b (X ma a ∧ Y ma b ∧ X=Y) ⇒ a=b

　　A. el ∀X∀Y (∀b b∈X ⇔ b∈Y) ⇒ X=Y

　　A.F　∃x∃B (∀a a ∈ B ⇔ F(a)) ∧ B ma x

　　Where X, Y, Z, .... are the variable for Atsumari , a, b, c, .... are the variable for Class

A. ma represents that the Atsumari makes only one class

　　A. el represents that the Atsumari is decided by its member

　　A.F is Axiom schema of unrestricted comprehension

　　A. F represents if you collect Classes which have property F then it becomes an Atsumari B and the Atsumari B makes a Class x

　　２. Translation to FC

The translation of ZF's formula to FC's formula is the following


x ∈ y in ZF is translated to ∃ B x ∈ B ∧ B ma y in FC　　　　- TR –

　　３. Russel's class

∀a a∈R ⇔ ¬(∃B a∈B ∧ B ma a)

The right side of formula means ¬(a∈a) in ZF Using TR

This Atsumari R makes Russel's Class r, so R ma r.

Let a=r then,

r∈R ⇔ ¬(∃B r∈B ∧ B ma r)

If　r∈R is true, considering that R ma r is also true, then

　　∃B r∈B ∧ B ma r　is true, then right side of formula is false. This is a contradiction.

So, the following formulas are gotten.

¬(r∈R), ∃B r∈B ∧ B ma r.



Idea “Set “ :

I use the word "Set" for representing a scale of a Class.

　　The definition of Set is the following.

Set x　Df. ¬(∃B x∈B ∧ B ma x)

Then Russel's Class is written as follows.

∀a a∈R ⇔ Set a

And results are,

¬(r∈R), ¬Set r

５. Model

On FC , Finite Model exists M5 is defined as follows:

U={0,1,2,3, n}

{ } ma 0, {0} ma 1, {0,1} ma 2, {0,1,2} ma 3, {0,1,2,3} ma n, {0,1,2,3,n} ma n,

For all other Atsumari X, X ma n

It is possible to verify the result of section 3. " Russel's Class " on M5.

On M5, classes 0, 1, 2, 3 are Set.

　　So, R={0,1,2,3}

and r=n , because {0,1,2,3} ma n

The two formulas of a conclusion of the section 3. are ¬(r∈R) , ∃B r∈B ∧ B ma r.

Both are true , because ¬(n∈{0,1,2,3}) and n∈{0,1,2,3,n} ∧ {0,1,2,3,n} ma n

Any model of FC satisfies all axioms of ZF except the axiom of foundation.

　　In FC, a class x such that ∃B x∈B ∧ B ma x exists, which means x∈x in ZF.

So, the model of FC doesn't satisfy the Axiom of Foundation

On M5, P(U)=U, naturally, 1-1 function between U and U exists. The existence of 1-1 function between P(U) and U is not contradiction

Where P(U) means part Atsumari of U
U Df. ∀x x∈U

Notice on M5 Fermat's Theorem is incorrect

2^3 + 3^3 = 3^3 = n



Where "-" and "+" are defined in the same way in ZF

In M5 , Ord U So , Natural Ordinal is represented
But it is possible to prove M5 is consistent , because M5 is finite
It is negation of Gedel's Theorem