The Role of Monotonicity in Descriptive Complexity Theory

Conference paper
Part of the Collegium Logicum book series (COLLLOGICUM, volume 2)


It is well-known that monotonicity, in a variety of guises, plays an essential role in descriptive complexity theory and finite model theory. In this paper, we highlight existing well-known roles and also explain two other not so well-known roles of monotonicity. The first arises due to an anomaly in logically characterizing NP using operators corresponding to traditional NP-complete problems; and the second arises due to the consideration of the logical characterization of complexity classes defined with respect to “monotone” models of computation.


Hamiltonian Path Relation Symbol Constant Symbol Projective Formula Oracle Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Afrati and S.S. Cosmadakis and M. Yannakakis, On Datalog vs. polynomial time, Proc. 10th ACM Ann. Symp. on Principles of Database Systems (1991) 13–23Google Scholar
  2. 2.
    M. Ajtai and R. Fagin, Reachability is harder for directed than for undirected finite graphs, J. Symbolic Logic 55 (1990) 113–150MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    M. Ajtai and Y. Gurevich, Monotone versus positive, J. Assoc. Comput. Mach. 34 (1987) 1004–1015MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    J.L. Balcâzar and J. Diaz and J. Gabarró, Structural Complexity Theory I, Springer-Verlag, Berlin (1988)Google Scholar
  5. 5.
    A.K. Chandra and D.C. Kozen and L.J. Stockmeyer, Alternation, Error Hyperlink reference not valid. put. Mach. 28 (1981) 14–133MathSciNetGoogle Scholar
  6. 6.
    A. Dawar and I.A. Stewart, manuscriptGoogle Scholar
  7. 7.
    R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7 (ed. R.M. Karp ) (1974) 43–73Google Scholar
  8. 8.
    M.R. Garey and D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco (1979)zbMATHGoogle Scholar
  9. 9.
    E. Grädel, On transitive closure logic, Lecture Notes in Computer Science Vol. 626 (1992) 149–163CrossRefGoogle Scholar
  10. 10.
    N. Immerman, Relational queries computable in polynomial time, Inform. Control 68 (1986) 86–104MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760–778MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    P.G. Kolaitis and J.A. Väänänen, Generalised quantifiers and pebble games on finite structures, J. Pure App. Logic,to appearGoogle Scholar
  13. 13.
    A.A. Razborov, A lower bound on the monotone network complexity of the logical permanent, Mat. Zametki 41 (1987) 598–607 (in Russian; English translation in: Math. Notes,41 (1987), 333–338)Google Scholar
  14. 14.
    W.L. Ruzzo, On uniform circuit complexity, J. Comput. System Sci. 22 (1981) 365–383MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    I.A. Stewart, Comparing the expressibility of languages formed using NP-complete operators, J. Logic Computat. 1 (1991) 305–330zbMATHCrossRefGoogle Scholar
  16. 16.
    I.A. Stewart, Complete problems involving boolean labelled structures and projection translations, J. Logic Computat. 1 (1991) 861–882zbMATHCrossRefGoogle Scholar
  17. 17.
    I.A. Stewart, Using the Hamiltonian path operator to capture NP, J. Comput. System Sci. 45 (1992) 127–151MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    I.A. Stewart, Logical characterizations of bounded query classes I: logspace oracle machines, Fund. Informat. 18 (1993) 65–92zbMATHGoogle Scholar
  19. 19.
    I.A. Stewart, Logical characterizations of bounded query classes II: polynomial-time oracle machines, Fund. Informat. 18 (1993) 93–105zbMATHGoogle Scholar
  20. 20.
    I.A. Stewart, Logical descriptions of monotone NP problems, J. Logic Cornputat. 4 (1994) 337–357zbMATHCrossRefGoogle Scholar
  21. 21.
    I.A. Stewart, Monotonicity and the expressibility of NP operators, Math. Logic Quart. 40 (1994) 132–140MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    I.A. Stewart, On completeness for NP via projection translations, Math. Systems Theory 27 (1994) 125–157MathSciNetzbMATHCrossRefGoogle Scholar
  23. 23.
    J.D. Ullman, Database and Knowledge-Base Systems, Computer Science Press (1989)Google Scholar
  24. 24.
    M. Vardi, Complexity of relational query languages, Proc. 14th ACM Ann. Symp. on Theory of Computing (1982) 137–146Google Scholar

Copyright information

© Springer-Verlag/Wien 1996

Authors and Affiliations

  1. 1.University of Wales SwanseaSwanseaUK

Personalised recommendations