  In the former article "Formal mathematical systems including a structural
induction principle" we have presented a unified theory for formal mathematical
systems including recursive systems closely related to formal grammars,
including the predicate calculus as well as a formal induction principle. In
this paper we present some further results and examples in order to illustrate
how this theory works.
