Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1998: Computer Science Logic pp 142–158Cite as

Invariant Definability and P/poly

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1584))

Abstract

We look at various uniform and non-uniform complexity classes within P/poly and its variations L/poly, NL/poly, NP/poly and PSpace/poly, and look for analogues of the Ajtai-Immerman theorem which characterizes AC 0 as the non-uniformly First Order Definable classes of finite structures. We have previously observed that the Ajtai-Immerman theorem can be rephrased in terms of invariant definability: A class of finite structures is FOL invariantly definable iff it is in AC 0. Invariant definability is a notion closely related to but different from implicit definability and Δ-definability. Its exact relationship to these other notions of definability has been determined in [Mak97].

Our first results are a slight generalization of similar results due to Molzan and can be stated as follows: let C be one of L, NL, P, NP, PSpace and \({\cal L}\) be a logic which captures C on ordered structures. Then the non-uniform \({\cal L}\)-invariantly definable classes of (not necessarily ordered) finite structures are exactly the classes in C/poly. We also consider uniformity conditions imposed on invariant definability and relate them to uniformity conditions on the advice sequences. This approach is different from imposing uniformity conditions on the circuit families.

The significance of our investigation is conceptual, rather than technical: We identify exactly the logical analogue of uniform and non-uniform complexity classes.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atserias, A., Balcázar, J.L.: Refining logical characterizations of advice complexity classes. In: First Panhellenic Symposium on Logic, Cyprus (1997) (to appear)

    Google Scholar 

  2. Ajtai, M.: ∑\(_1^1\)formulae on finite structures. Annals of Pure and Applied Logic 24, 1–48 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ajtai, M.: First-order definability on finite structures. Annals of Pure and Applied Logic 45, 211–225 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Barrington, D.A.M., Compton, K., Straubing, H., Thérien, D.: Regular languages in NC1. Journal of Computer and System Sciences 44, 478–499 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Barwise, J., Feferman, S. (eds.): Model-Theoretic Logics. Perspectives in Mathematical Logic. Springer, Heidelberg (1985)

    Google Scholar 

  6. Barrington, D.A.M., Immerman, N.: Time, hardware and uniformity. In: Proccedings of the 9th Structure in Complexity Theory, pp. 176–185. IEEE Computer Society, Los Alamitos (1994)

    Chapter  Google Scholar 

  7. Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity in nc1. JCSS 41, 274–306 (1990)

    MATH  MathSciNet  Google Scholar 

  8. Boppana, R.B., Sipser, M.: The complexity of finite functions. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 14, vol. 1. Elsevier Science Publishers, Amsterdam (1990)

    Google Scholar 

  9. Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  10. Frick, M., Makowsky, J.A., Pnueli, Y.B.: Oracles and Lindström quantifiers on ordered structures. Submitted to Information and Computation (in revision)

    Google Scholar 

  11. Frick, M.: Oracles and quantifiers. PhD thesis, Department of Mathematics, University of Freiburg, Freiburg, Germany (1997)

    Google Scholar 

  12. Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial hierarchy. J. Math. Systems Theory 17, 13–27 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gurevich, Y., Lewis, H.: A logic for constant-depth circuits. Information and Control 61, 65–74 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gottlob, G.: Relativized logspace and generalized quantifiers over finite ordered structures. Journal of Symbolic Logic 62(2), 545–574 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  15. Grädel, E.: On logical descriptions of some concepts in structural complexity theory. In: Börger, E., Kleine Büning, H., Richter, M.M. (eds.) CSL 1989. LNCS, vol. 440, pp. 163–175. Springer, Heidelberg (1990)

    Google Scholar 

  16. Immerman, N.: Languages that capture complexity classes. SIAM Journal on Computing 16(4), 760–778 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  17. Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1998)

    Google Scholar 

  18. Johnson, D.S.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 2, vol. 1, Elsevier Science Publishers, Amsterdam (1990)

    Google Scholar 

  19. Kolaitis, P.G.: Implicit definability on finite structures and unambiguous computations. In: LiCS 1990, pp. 168–180. IEEE, Los Alamitos (1990)

    Google Scholar 

  20. Lindell, S.: A purely logical characterization of circuit uniformity. In: Proceedings of the 7th conference on Structures in Complexity (1992)

    Google Scholar 

  21. Makowsky, J.A.: Translations, interpretations and reductions. Lecture Notes of a course given at ESSLLI 1997 in Aix-en-Provence (August 1997)

    Google Scholar 

  22. Makowsky, J.A.: Invariant definability. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) KGC 1997. LNCS, vol. 1289, pp. 186–202. Springer, Heidelberg (1997)

    Google Scholar 

  23. Molzan, B.: Expressibility and nonuniform complexity classes. SIAM Journal of Computing 19(3), 411–423 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  24. Makowsky, J.A., Pnueli, Y.B.: Oracles and quantifiers. In: Meinke, K., Börger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol. 832, pp. 189–222. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  25. Makowsky, J.A., Pnueli, Y.: Logics capturing oracle complexity classes uniformly. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 463–479. Springer, Heidelberg (1995)

    Google Scholar 

  26. Sazonov, V.: Polynomial computability and recursivity in finite domains. Elektronische Informationsverarbeitung und Kybernetik 16, 319–323 (1980)

    MATH  MathSciNet  Google Scholar 

  27. Stewart, I.A.: Comparing the expressibility of languages formed using NPcomplete operators. Journal of Logic and Computation 1(3), 305–330 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  28. Stewart, I.A.: Using the Hamilton path operator to capture NP. Journal of omputer and Systems Sciences 45, 127–151 (1992)

    Article  MATH  Google Scholar 

  29. Stewart, I.A.: Logical characterization of bounded query classes i: Polynomial ime oracle machines. Fundamenta Informaticae 18, 93–105 (1993)

    MATH  MathSciNet  Google Scholar 

  30. Stewart, I.A.: Logical characterizations of bounded query classes II: Polynomial–time oracle machines. Fundamenta Informaticae 18, 93–105 (1993)

    MATH  MathSciNet  Google Scholar 

  31. Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Progress in Theoretical Computer Science. Birkhäuser, Basel (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion–Israel Institute of Technology, IL-32000, Haifa, Israel

    J. A. Makowsky

Authors
  1. J. A. Makowsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building Parks Road Oxford,, OX1 3QD, United Kingdom

    Georg Gottlob

  2. GREYC, Université de Caen, CNRS, Campus 2, F-14032, Caen cedex, France

    Etienne Grandjean

  3.  ,  

    Katrin Seyr

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Makowsky, J.A. (1999). Invariant Definability and P/poly . In: Gottlob, G., Grandjean, E., Seyr, K. (eds) Computer Science Logic. CSL 1998. Lecture Notes in Computer Science, vol 1584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703163_10

Download citation

  • DOI: https://doi.org/10.1007/10703163_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65922-8

  • Online ISBN: 978-3-540-48855-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation