Easier Ways to Win Logical Games

in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M. Vardi, On monadic NP vs monadic co-NP, Information and Computation,120 (1994), 78{92. 16] H. Gaifman, On local and non-local properties, in \Proceedings of the Herbrand Symposium, Logic Colloquium '81," North Holland, 1982. 17] S. Grumbach and T. Milo. Towards tractable algebras for bags. JCSS, 52 (1996), 570{588. 18] S. Grumbach, L. Libkin, T. Milo and L. Wong. Query languages for bags: expressive power and complexity. SIGACT News, 27 (1996), 30{37. 19] W. Hanf. Model-theoretic methods in the study of elementary logic. In J.W. Addison et al, eds, The Theory of Models, North Holland, 1965, pages 132{145. 20] L. Hella. Logical hierarchies in PTIME. Information and Computation, 129 (1996), 1{19. 21] N. Immerman. Descriptive complexity: A logician's approach to computation. Notices of the AMS 42...

• Type: Conference
• Year: 1996
• Where: DIMACS
• Authors: Ronald Fagin
• Keywords: Descriptive Complexity, DIMACS 1996, DIMACS 2001, Quanti Ers, Unary Quanti Ers