A formal language with an alphabet is a set of strings in the alphabet ,
i.e. a subset of the free monoid. #m/def/logic
The strings in are called well-formed formulae or just formulae of .
Usually there is an effective procedure for determining if a given string is a formula of ,
e.g. as defined by a formal grammar.