Well-structured mathematical logic (Q2849811)

This is not a book on mathematical logic in the standard sense of the term ``mathematical logic''. Instead, the author aims to provide a completely new form of formalization of mathematics and mathematical reasoning -- largely based upon ideas from structured programming in computer science.NEWLINENEWLINEThe main tools the author uses for his analysis of phrase structures are nested, flowing, and random-accessed structures. His formalized mathematical texts hence look like structured programs. The core expressive means besides the usual first-order quantifications are two kinds of substitution operators, and unary operators for: given, required, not.NEWLINENEWLINEFor this formalization, basic inference rules are given and intuitively motivated. Therefore, something like a strong completeness proof for this inference mechanism is not available. In any case, classical logic is supposed to hold in the author's metalanguage considerations.