Existential second-order logic over strings

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 16-27

  Eiter, T ^a   Gottlob, G ^b   Gurevich, Y ^c  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c University of Michigan   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; FORMAL LOGIC; MODEL CHECKING;

COMPLEMENTATION; EXISTENTIAL SECOND-ORDER LOGIC; FINITE WORDS; MONADIC SECOND-ORDER LOGIC; WORD STRUCTURES;

COMPUTER CIRCUITS;

EID: 84976252636     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705640     Document Type: Conference Paper

References (39)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. D. Basin and N. Klarlund. Hardware verification using monadic second-order logic. Proc. 7th Intl. Conf. on Computer Aided Verification (CAV'95), LNCS 939, pp. 31{41, 1995.
3. E. Borger, E. Gradel, and Y. Gurevich. The Classical Decision Problem. Springer, 1997.
4. J. R. Buchi. Weak Second-Order Arithmetic and Finite Automata. Z. Math. Logik Grund. Math., 6:66{92, 1960.
5. J. R. Buchi. On a Decision Method in Restricted Second-Order Arithmetic. In E. Nagel et al. (eds), Proc. International Congress on Logic, Methodology and Philosophy of Science, pages 1{11, Stanford, CA, 1960. Stanford University Press.
6. M. de Rougemont. Second Order and Inductive Definability on Finite Structures. Z. Math. Logik Grund. Math., 33:47{63, 1987.
7. A. Durand, C. Lautemann, and T. Schwentick. Fragments of binary NP. J. Logic & Comp., to appear.
8. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
9. T. Eiter and G. Gottlob. On the Expressiveness of Frame Satisfiability and Fragments of Second Order Logic. J. Symbolic Logic, to appear.
10. T. Eiter, G. Gottlob, and Y. Gurevich. Existential Second-Order Logic over Strings. Report DBAI-TR-9714, Institut fur Informationssysteme, TU Wien, Dec. 1997. (Available at URL http://www.dbai.tuwien.ac.at/ftp/papers/eiter/dbaitr-9714.ps.gz or by email from the authors.).
11. R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In R. M. Karp, editor, Complexity of Computation, pp. 43{ 74. AMS, 1974.
12. R. Fagin. Generalized Monadic Spectra. Z. Math. Logik Grund. Math., 21:89{96, 1975.
13. R. Fagin. Finite-Model Theory-A Personal Perspective. TCS, 116(1):3{31, 1993.
14. E. Gradel. The Expressive Power of Second-Order Horn Logic. In Proc. STACS-91, LNCS 480, pp. 466{477, 1991.
15. E. Gradel. Capturing Complexity Classes with Fragments of Second Order Logic. TCS, 101:35{ 57, 1992.
16. E. Grandjean. Universal quantifiers and time complexity of random access machines. Math. Sys. Th., 13:171{187, 1985.
17. Y. Gurevich. Logic and the Challenge of Computer Science. In E. Borger (ed), Trends in Theoretical Computer Science, CS Press, 1988.
18. J.G. Henriksen, J. Jensen, M. Jrgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic Second-order Logic in Practice. in Proc. TACAS'95, LNCS 1019, pp. 89{110, 1996.
19. N. Immerman. Relational Queries Computable in Polynomial Time. Inf. Control, 68:86{104, 1986.
20. N. Immerman. Descriptive Complexity Theory. Springer, to appear.
21. N. Klarlund. Mona & Fido: The Logic- Automaton Connection in Practice. In Proc. CSL '97, LNCS. Springer, 1998 (to appear).
22. P. Kolaitis and M. Y. Vardi. 0-1 Laws and Decision Problems for Fragments of Second-Order Logic. Information and Computation, 87:302{ 338, 1990.
23. C. Lautemann, T. Schwentick, and D. Therien. Logics for context-free languages. In Proc. 1994 Annual EACSL Conference, pp. 205{216, 1995.
24. J. F. Lynch. The quantifier structure of sentences that characterize nondeterministic time complexity. Computational Complexity, 2:40{66, 1992.
25. R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, 1971.
26. F. Olive. A Conjunctive Logical Characterization of Nondeterministic Linear Time. In Proc. CSL '97, LNCS. Springer, 1998 (to appear).
27. L. Pacholski and W. Szwast. On the 0-1Law for the Existential Second-Orde Minimal Godel Sentences With Equality. In Proc. LICS'91, pp. 290{ 285.
28. J.-E. Pin. Varieties of Formal Languages. North Oxford, London and Plenum, New York, 1986.
29. J.-E. Pin. Logic On Words. Bulletin of the EATCS, 54:145{165, 1994.
30. J.-E. Pin. Semigroups and Automata on Words. Annals Mathematics & AI, 16:343{384, 1996.
31. E. Rosen. An Existential Fragment of Second Order Logic. Revised manuscript, December 1996.
32. T. Schwentick. Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. In Proc. ICALP '95, pp. 405{416, 1995.
33. L. J. Stockmeyer. The Polynomial-Time Hierarchy. TCS, 3:1{22, 1977.
34. H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkhauser, 1994.
35. H. Straubing, D. Therien, and W. Thomas. Regular Languages Defined with Generalized Quantifiers. Information and Computation, 118:289{ 301, 1995.
36. W. Thomas. Automata on Infinite Objects. In J. van Leeuwen (ed), Handbook of TCS (B), ch. 4. Elsevier, 1990.
37. W. Thomas. Languages, Automata, and Logic. In G. Rozenberg and A. Salomaa, editors, Hand- book of Formal Language Theory, III, pp. 389{ 455. Springer, 1996.
38. B. A. Trakhtenbrot. Finite Automata and the Logic of Monadic Predicates. Dokl. Akad. Nauk SSSR, 140:326{329, 1961.
39. M. Vardi. Complexity of Relational Query Languages. In Proc. STOC 82, pp. 137{146, 1982.