| J.A. Makowsky and Y. Pnueli, Computable quantiers and logics over nite structures, in: Quantiers: Logics, Models and Computation, Volume 1 (ed. M. Krynicki et al.), Kluwer (1995) 313-357. |
....of NP inspired the rst consideration of Lindstr om quanti ers as oracles: such a consideration was made by Gr adel [13] the aforementioned papers that we wish to focus. There are already a number of surveys in which any such material missing from this paper might be found (notably [28]) as well as the standard nite model theory reference [9] We assume that the reader is acquainted with the basic notions of complexity theory (as can be found in, for example, 11] We include sketches of important proofs and we hope that we give a avour of how current research at the ....
J.A. Makowsky and Y. Pnueli, Computable quantiers and logics over nite structures, in: Quantiers: Logics, Models and Computation, Volume 1 (ed. M. Krynicki et al.), Kluwer (1995) 313-357.
....in all arities, i.e. all vectorizations of the operators are needed. In some recent papers dealing with generalized quanti ers on nite structures the assumption of being closed under vectorizations has even been taken as a part of the de nition of logics with generalized quanti ers (see, e.g. [MP95]) Vectorization also remedies the defect of FO(Q) that prevented capturing PTIME by nitely many generalized quanti ers: in [Daw95] Dawar proved that if there is any reasonable logic that captures PTIME on unordered structures, then there is a single quanti er Q such that FO ( Q) captures ....
J. Makowsky and Y. Pnueli. Computable quantiers and logics over nite structures. In M. Krynicki, M. Mostowski, and L. Szczerba, editors, Quantiers: Logics, Models and Computation, volume I, pages 313-358. Kluwer Academic Publishers, Dordrecht/Boston/London, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC