An existential fragment of second order logic

Archive for Mathematical Logic

Volumn 38, Issue 4-5, 1999, Pages 217-234

  Rosen, Eric ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033422454     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050126     Document Type: Article

References (22)

1. F. Afrati, S. S. Cosmadakis, and M. Yannakakis. On Datalog vs polynomial time. Journal of Computer and System Sciences, 51:177-196, 1995.
2. 1-formulae on finite structures. Annals of Pure and Applied Logic, 24:1-48, 1983.
3. A. Blass and Y. Gurevich. Existential fixed-point logic. In E. Börger, editor, Computation Theory and Logic, volume 270 of Lecture Notes in Computer Science, pages 20-36. Springer, 1987.
4. K. Compton. A deductive system for existential least fixed point logic. Journal of Logic and Computation, 3:197-213, 1993.
5. A. Dawar. A restricted second order logic for finite structures. In D. Leivant, editor, Logic and Computational Complexity, volume 960 of Lecture Notes in Computer Science, pages 393-413, Springer, 1995.
6. R. Fagin. Finite-model theory - a personal perspective. Theoretical Computer Science, 116(1):3-31, 1993.
7. R. Fagin, L. J. Stockmeyer, and M. Y. Vardi. On monadic NP vs. monadic co-NP. Information and Computation, 120(1):78-92, 1995.
8. M. Grohe. Existential least fixed-point logic and its relatives. Journal of Logic and Computation, 7:205-228, 1997.
9. D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity, pages 67-161. The MIT Press/Elsevier, 1990.
10. Ph. G. Kolaitis and J. Väänänen. Generalized quantifiers and pebble games on finite structures. Annals of Pure and Applied Logic, 74(1):23-75, 1995.
11. Ph. G. Kolaitis and M. Y. Vardi. The decision problem for the probabilities of higher-order properties. In Proc. 19th ACM Symp. on Theory of Computing, pages 425-435, 1987.
12. Ph. G. Kolaitis and M. Y. Vardi. 0-1 laws and decision problems for fragments of second-order logic. Information and Computation, 87:302-338, 1990.
13. Ph. G. Kolaitis and M. Y. Vardi. On the expressive power of Datalog: tools and a case study. Journal of Computer and System Sciences, 51(1):110-134, 1995.
14. G. Kreisel and J.-L. Krivine. Elements of Mathematical Logic. North Holland, 1972.
15. T. Lacoste. Lois de convergence et lois 0-1 dans les structures aléatoires finies: une approche logique et finitiste. PhD thesis, Université Paris VII, 1996.
16. A. I. Mal'cev. Model correspondences. In B. F. Wells, III, editor, The Metamathematics of Algebraic Systems: Collected Papers: 1936-1967, pages 66-94. North-Holland, 1971. Translated from the Russian.
17. J. Nešetřil and V. Rödl. Partitions of finite relational and set systems. Journal of Combinatorial Theory A, 22:289-312, 1977.
18. J. Nešetřil and V. Rödl. The partite construction and Ramsey set systems. Discrete Mathematics 75:327-334, 1989.
19. E. Rosen, S. Shelah, and S. Weinstein, k-universal finite graphs. In R. Boppana and J. Lynch, editors, Logic and Random Structures, pages 65-77. American Mathematical Society, 1997.
20. E. Rosen and S. Weinstein. Preservation theorems in finite model theory. In D. Leivant, editor, Logic and Computational Complexity, volume 960 of Lecture Notes in Computer Science, pages 480-502, Springer, 1995.
21. T. Schwentick. On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied Logic, 79:61-92, 1996.
22. O. Shmueli. Decidability and expressiveness aspects of logic queries. In Proc. 6th ACM Symp. on Principles of Database Systems, pages 237-249, 1987.