 The second step is to interpret the propositional formulas in the same manner in which terms of a first-order language are interpreted in a structure. In this way the concept of \(L\)-algebra comes into play. On a given set \(A\), an \(n\)-ary connective is interpreted by an \(n\)-ary function on \(A\) (a map that assigns an element of \(A\) to every sequence \(\langle a_1 , \ldots ,a_n\rangle\) of elements of \(A)\). This procedure is a generalization of the truth-table interpretations of the languages of logic systems like classical logic and Łukasiewicz and Post’s finite-valued logics. In those cases, given the set of truth-values at play the function that interprets a connective is given by its truth-table.