T. Schwentick and K. Barthelmann. Local normal forms for first-order logic with applications to games and automata. STACS 1998, pages 444-454.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to capturing TC 0 [Et97; LW98] In database theory, logics with counting mechanisms model aggregate functions commonly found in commercial query languages. Thus, locality was used to prove expressivity bounds for query languages with aggregation [DLW00; HLNW99] For applications to automata, see [SB98]. The above mentioned papers considered a sequence of more and more powerful logics, each of which was proved to be local, starting with FO with counting quantifiers, and ending with a logic that permits arbitrary predicates on natural numbers, a limited form of infinitary connectives [Li00] and ....

T. Schwentick and K. Barthelmann. Local normal forms for first-order logic with applications to games and automata. In STACS'98, Springer LNCS 1377, 1998, pages 444--454. ACM Transactions on Computational Logic, Vol. TBD, No. TBD, TBD TBD.

....we shall show (as a corollary of the main result) that the answer to the above question is negative. To prove the main result, we exploit the locality techniques in finite model theory. Originated in the work by Hanf [15] and Gaifman [10] they were recently a subject of renewed attention [5, 9, 13, 26, 23, 24, 28, 34]. The BNDP is typically proved by showing that a logic satisfies an analog of either Hanf s or Gaifman s theorem [23] However, those fail for L 1 (C) in the presence of several classes of preorders. Nevertheless, we prove a statement, weaker than Gaifman s theorem, for counting logics in the ....

T. Schwentick and K. Barthelmann. Local normal forms for first-order logic with applications to games and automata. In STACS'98, Springer LNCS 1377, 1998, pages 444--454.

....A and B. That is, A d B iff n d (A; n d (B; for every : Corollary 4.4 ( 17] Let n be a positive integer. There there exists a positive integer d such that A d B implies A j n FO B. 2 1 New winning conditions for the duplicator based on Gaifman s theorem were presented recently in [45]. 11 Delta Delta Delta Delta Delta Delta Delta Delta Delta B A Delta Delta Delta Delta Delta Delta Delta Delta Delta Delta Delta Delta Phi Phi Phi H H H A A A Delta Delta Delta Phi Phi Phi H H H A A A Delta Delta Delta Phi Phi ....

T. Schwentick and K. Barthelmann. Local normal forms for first-order logic with applications to games and automata. In Proc. 15th Symp. on Theoretical Aspects of Computer Science (STACS'98), Springer Verlag, 1998, to appear.

....of many useful tools for dealing with Ehrenfeucht games. Besides the already mentioned Ajtai Fagin game, there have been invented several ways to simplify the proof of the existence of a winning strategy for the duplicator in the first order Ehrenfeucht game. We refer the interested reader to [FSV95, AF97, Sch94a, SB98] and, for a survey to [Fag97] A new development in the area of monadic ESO was initiated by Ajtai et al. AFS97] They consider various closures of monadic ESO, e.g. formulas that allow first order quantification in front of existential monadic second order quantifiers and they prove very nice ....

T. Schwentick and K. Barthelmann. Local normal forms for first-order logic with applications to games and automata. In Proc. 15th Symposium on Theoretical Aspects of Computer Science STACS 98, pages 444--454, 1998.

No context found.

T. Schwentick and K. Barthelmann. Local normal forms for first-order logic with applications to games and automata. STACS 1998, pages 444-454.

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