 In such a logic one may be a able to say things that are not expressible in FO. For example, it is well-known that in FO the notion of finiteness cannot be expressed. Thus there is no way to say, of an ordering relation \(&lt;\), that each element has only finitely many predecessors, for instance. But this is just the sort of thing one can express in \(\FO(Q_0)\):