• DocumentCode
    1996844
  • Title

    The expressive power of finitely many generalized quantifiers

  • Author

    Dawar, Anuj ; Hella, Lauri

  • Author_Institution
    Dept. of Comput. Sci., Univ. Coll. of Swansea, UK
  • fYear
    1994
  • fDate
    4-7 Jul 1994
  • Firstpage
    20
  • Lastpage
    29
  • Abstract
    We consider extensions of first order logic (FO) and fixed [Bpoint logic (FP) by means of generalized quantifiers in the sense of P. Lindstrom (1966). We show that adding a finite set of such quantifiers to FP fails to capture PTIME, even over a fixed signature. We also prove a stronger version of this result for PSPACE, which enables us to establish a weak version of a conjecture formulated previously by Ph.G. Kolaitis and M.Y. Vardi (1992). These results are obtained by defining a notion of element type for bounded variable logics with finitely many generalized quantifiers. Using these, we characterize the classes of finite structures over which the infinitary logic L∞w w extended by a finite set of generalized quantifiers Q and is no more expressive than first order logic extended by the quantifiers in Q
  • Keywords
    computational complexity; formal logic; PSPACE; PTIME; bounded variable logics; expressive power; finite structures; finitely many generalized quantifiers; first order logic; fixed point logic; Computational complexity; Computational modeling; Computer science; Educational institutions; Extraterrestrial measurements; Hardware; Logic; Polynomials; Q measurement; Time measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on
  • Conference_Location
    Paris
  • Print_ISBN
    0-8186-6310-3
  • Type

    conf

  • DOI
    10.1109/LICS.1994.316090
  • Filename
    316090