Formal Mathematical Systems including a Structural Induction Principle
arXiv:2005.04951
Abstract
We present 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. 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 specific rules of inference. Its extension to formal mathematical systems leads to a formal structural induction with respect to the axioms of the underlying recursive system. This approach provides some new representation theorems without using artificial and difficult interpretation techniques. Within this frame we will also derive versions of Gödel's First and Second Incompleteness Theorems for a general class of axiomatized formal mathematical systems.
We only did necessary changes in order to preserve the character of the original work. "Further results and examples for formal mathematical systems with structural induction" is available under the link arXiv:2008.07385. 70 pages, 2 figures