scientific article; zbMATH DE number 4053565
[For the entire collection see Zbl 0635.00014.] First order theories not only can be used in proving properties of programs, but have also relevance in representation theory. The desire to represent first order theories in a computer in a feasible way requires the facility to discuss meta-mathematical notions. Using metamathematics will eventually allow to construct systems which can formally discuss how they reason. In this paper we present two different first order axiomatizations of the metamathematics of the logic which FOL (First Order Logic proof checker) checks and show several proofs using the two. The difference between the axiomatizations is that one defines the metamathematics in a many sorted logic and the other does not. Proofs are then compared and used to discuss the adequacy of some FOL features.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789524)