We formulate a formal syntax of approximate formulas for the logic with counting
quantifiers, \mathcal{SOLP}, studied by us in \cite{aaco06}, where we showed the
following facts:
(i) In the presence of a built--in (linear) order, \mathcal{SOLP} can
describe {\bf NP}--complete problems and fragments of it capture classes like
{\bf P} ... more >>>