by Kunik, M..
Series: 2002-31, Preprints
This study provides a general frame for formal mathematical systems
which may be interesting for people working in formal logic,
theoretical computer science and linguistics.
We introduce recursive systems generating
the recursively enumerable relations between lists of terms,
the basic objects under consideration. A recursive system
consists of axioms which are special quantifier-free positive horn formulas
and of special rules of inference.
Its extension to formal mathematical systems includes
the predicate calculus as well as a structural induction principle
with respect to the axioms of the underlying recursive system.
We have also formulated our main results about formal mathe\-matical systems
for quite general restrictions in the argument lists of the formulas,
which enables different kind of applications.
Formal mathematical systems, structural induction principle, incompleteness theorems