Re: Set theory ZFC is inconsistent.

Def.1.
m(p,r)=l <--> {(E(n)){Pf(n,l)}}&(l=G{p,r})}

Def.2.
http://www.blackwellpublishing.com/content/BPL_Images/Content_store/Sample_chapter/0631206930/Goble%20philoso.pdf#search='firstorder%20logic'
Every first-order language has an infinite collection of symbols called
variables:
X(1)=x1, X(2)=x2, . . .,X(p)=xp,...
p=1,2,...
To avoid writing subscripts all the time, it is often assumed that
x, y, z, u, v
and a few similar symbols are variables too.
Def.3.
X(W1)=union{X(p)|p belong W1}




.

Relevant Pages

  • Re: Set theory ZFC is inconsistent.
    ... Every first-order language has an infinite collection of symbols called ... To avoid writing subscripts all the time, ... X=union{X|p belong W1} ...
    (sci.logic)
  • Re: Set theory ZFC is inconsistent.
    ... jaykov wrote: ... Every first-order language has an infinite collection of symbols called ... To avoid writing subscripts all the time, ...
    (sci.logic)
  • Re: Set theory ZFC is inconsistent.
    ... jaykov wrote: ... Every first-order language has an infinite collection of symbols called ... To avoid writing subscripts all the time, ...
    (sci.logic)