We introduce an extension of classical propositional logic with counting quantifiers. These forms quantification make it possible to express that a formula is true in certain portion the set all its interpretations. Beyond providing sound and complete proof system for this logic, we show validity problems can be used capture complexity classes. More precisely, decision prenex formulas perfectly...