ABSTRACT
In the first three sections of this chapter we build a formal language for each signature σ = (C, F, R, σ′). More precisely, we build a first-order (also called an elementary) language L = L(σ), whose building blocks are the symbols from a certain alphabet, which depends on the signature σ, and whose syntactic categories are terms and formulas.
