 In addition to the truth conditions associated with generalized quantifiers, one may study the computations required to establish the truth of a quantified statement in a model. Indeed, generalized quantifiers turn up in various places in the part of computer science that studies computational complexity. In this context, we restrict attention to finite universes, and assume Isom throughout. So a quantifier is essentially a set of finite models; by Isom we can assume that models of cardinality m all have the same domain \(M = \{1,\ldots,m\}\). Such models can be coded as words, i.e. finite strings of symbols. For example, a model \((M,A)\) of type \({\langle}1{\rangle}\) can be seen as a binary word \(a_1\ldots a_m\), where \(a_i\) is 1 if \(i\in A\) and 0 otherwise. Thus \(|A|\) is the number of 1’s and \(|M\!-\!A|\) the number of 0’s; by Isom, the order in the string doesn’t matter. So Q becomes a set \(W_Q\) of words, that is, a formal language: a subset of the set of all finite strings of coding  symbols.[15]