3.1.3. The Formalism "First-Order Predicate Logic" (mFOL)

This example is meant to provide some evidence that our framework lives up to Objective 1 (p. 4). In the FOL-example, we work within the formalism many-sorted firstorder logic without functions. Here, we move one abstraction level up and intend to describe this formalism as such. The "m" in "mFOL" stands for meta.

The sketches in the FOL-example are related to concepts like generators and defining relations in Group Theory and literals and facts in Logic Programming but are not a common ingredient in traditional expositions of First-Order Logic. The sketches that appear in this example, however, reconstruct the concept many-sorted signature as we meet it in the FOL-example. As an example, we reconstruct the sample signature we will work with in the FOL-example. Thus, the FOL-example and the mFOL-example together exemplify the topic of meta-modeling.
