We analyze computational aspects of partially ordered quantification in first-order logic. Show that almost any non-linear quantifier, applied to quantifier-free first-order formula suffices to express an -complete predicate. The remaining non-linear quantifiers experiment exactly co- predicates.