[FOM] Predicative Set Theory

[Zuhair Abdul Ghafoor Al-Johar]

Dear Sirs,

 The following is a theory defined in L(w1,w) where L is first order logic with equality and membership, that I think it to be equi-interpretable to a subset of second order arithmetic stronger than PA. It is Categorical ! something that its finitary counterparts are not. Of course the main feature is that it forms infinite sets in a predicative manner. The expressive power of this theory is of course much stronger than its finitary counterparts. So it combines Predicativity, Expressiveness and Categoricity and is defined in a complete (and implicationally complete) logical language that admits provability.

The exposition of this theory is present at: http://zaljohar.tripod.com/predicative.txt

Best regards


Zuhair Al-Johar