Volume 7: January - December 1997

Issue 3: 1997

Table of Contents


  • Expressive power and complexity in algebraic logic
  • R. Hirsch

    Pages: 309 - 351


  • Complexity of satisfiability problems with symmetric polynomial clauses
  • N. Creignou and M. More

    Pages: 353 - 365


  • Regular search spaces and constructive negation
  • A. Momigliano1 and M. Ornaghi2

    Pages: 367 - 403


  • Fixed-point logics, generalized quantifiers, and oracles
  • H. Imhof

    Pages: 405 - 525


    Part of the OUP Journal of Logic and Computation WWW service


    General Information

    Click here to register with OUP.

    This page is maintained by OUP admin

    Part of the OUP Journals World Wide Web service.

    Last modification: 22 Jul 1997


    Copyright© Oxford University Press, 1997.