Can someone give an example of a *finite* set of sentences T (in the language { \epsilon })
with consequences (necessarily strictly) containing all instances of axioms of ZFC ?
No schemas are allowed, and nothing like 0=1, of course.
The lesser the total number of symbols in T is, the better.
Thank you, Jan