Formal Definition of Class P and Quantifier Order

P is the set of languages decided by ONE algorithm in ONE fixed polynomial time bound for ALL inputs — the order ∃A ∃c ∀x is what makes it polynomial.