Editing PP (complexity) (section)

==References==
*{{Cite book|first=C.|last=Papadimitriou|author-link=Christos Papadimitriou|title=Computational Complexity|chapter=chapter 11|publisher=Addison-Wesley|year=1994}}.
*{{Cite book|first=E.|last=Allender|contribution=A note on uniform circuit lower bounds for the counting hierarchy|title=Proceedings 2nd International Computing and Combinatorics Conference (COCOON)|volume=1090|publisher=Springer-Verlag|series=Lecture Notes in Computer Science|pages=127–135|year=1996}}.
*{{cite journal
 | last1 = Burtschick | first1 = Hans-Jörg
 | last2 = Vollmer | first2 = Heribert
 | doi = 10.1142/S0129054198000180
 | id={{ECCC|1996|96|005}}
 | issue = 3
 | journal = Int. J. Found. Comput. Sci.
 | pages = 277–294
 | title = Lindström quantifiers and leaf language definability
 | volume = 9
 | year = 1998}}