Spectra of monadic second-order formulas with one unary function

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 291-300

  Gurevich, Yuri ^a   Shelah, Saharon ^b,c  

^a MICROSOFT RESEARCH   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; THEOREM PROVING; COMPUTER SCIENCE; HEART; MATHEMATICAL TECHNIQUES;

UNARY FUNCTIONS;

FUNCTIONS; COMPUTERS;

FUNCTION SYMBOLS; LOGIC; SECOND ORDERS; UNARY FUNCTIONS; VOCABULARY;

EID: 0042969143     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Egon Börger, Erich Grädel and Yuri Gurevich, "The Classical Decision Problem", Springer, 1997.
2. J. R. Büchi, "On a decision method in restricted second-order arithmetic", in "Logic, Methodology and Philosophy of Science", eds. E. Nagel et al., Stanford University Press, 1962, 1-11.
3. Arnaud Durand, Ronald Fagin and Bernd Loescher, "Spectra with only unary function symbols", Proceedings of the 1997 Annual Conference of the European Association for Computer Science Logic (CSL'97). [The paper can be found at http://www.almaden.ibm.com/cs/people/fagin/]
4. Sol Feferman and Robert L. Vaught, "The first-order properties of products of algebraic systems", Fundamenta Mathematicae 47 (1959), 57-103.
5. Yuri Gurevich, "Modest theory of short chains. I", Journal of Symbolic Logic 44:4 (1979), 481-490.
6. Yuri Gurevich, "Monadic second-order theories", In "Model-Theoretical Logics" (ed. J. Barwise and S. Feferman), Springer-Verlag, 1985, 479-506.
7. Yuri Gurevich and Alexander Rabinovich, "Definability and Undefinability with Real Order at the Background", Journal of Symbolic Logic 65:2 (2000), 946-958.
8. Yuri Gurevich and S. Shelah, "Modest theory of short chains, II", Journal of Symbolic Logic 44 (1979), 491-502.
9. Yuri Gurevich and Saharon Shelah, "The decision problem for branching time logic", Journal of Symbolic Logic 50 (1985), 668-681.
10. Wilfrid Hodges, "Model theory", Cambridge University Press 1993.
11. Hans Läuchli, "A decision procedure for the weak second-order theory of linear order", In "Contributions to Mathematical Logic", eds. H. A. Schmidt et al., North Holland, 1968, 189-197.
12. Michael O. Rabin, "Decidability of Second-Order Theories and Automata on Infinite Trees", Trans. of American Math. Society 141 (1969), 1-35.
13. Alexander Rabinovich, "Composition theorem for generalized sum", http://www.math.tau.ac.il/rabinoa/journal.html.
14. Klaus Reinhardt, "The complexity of translating logic to finite automata", in "Automata, Logic, and Infinite Games", eds. E. Grädel, W. Thomas, T. Wilke, Springer Lecture Notes in Computer Science 2500, 235-242.
15. Saharon Shelah, "The monadic theory of order", Annals of Math. 102 (1975), 379-419 [Sh:42].
16. Saharon Shelah, "On the very weak 0 - 1 law for random graphs with orders", J. of Logic and Computations 6 (1996), 137-159 [Sh:463].
17. Saharon Shelah, "Spectra of monadic second-order sentences", in preparation [Sh:F599]
18. Larry J. Stockmeyer, "The complexity of decision problems in automata theory and logic", PhD thesis, Department of Electrical Engineering, MIT, Boston, MA, 1974.
19. Wolfgang Thomas, "Ehrenfeucht games, the composition method, and the monadic theory of ordinal words", Lecture Notes in Computer Science 1261 (1997), 118-143.
20. R. Suzanne Zeitman, "The Composition Method", PhD Thesis, Wayne State University, Michigan, 1994.