On polynomial time computation over unordered structures

Journal of Symbolic Logic

Volumn 67, Issue 3, 2002, Pages 1093-1125

  Blass, Andreas ^a   Gurevich, Yuri ^a   Shelah, Saharon ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036745472     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1190150152     Document Type: Article

References (21)

1. rd ACM Symposium on Theory of Computing, 1991 pp. 209-219.
2. A. Blass and Y. Gurevich, Strong extension axioms and Shelah's zero-one law for choiceless polynomial time, to appear.
3. _, Equivalence relations, invariants, and normal forms, SIAM Journal on Computing, vol. 13 (1984), pp. 682-689.
4. _, Equivalence relations, invariants, and normal forms, II, Logic and Machines: Decision Problems and Complexity (E. Börger, G. Hasenjaeger, and D. Rödding, editors), Lecture Notes in Computer Science, vol. 171, Springer-Verlag, 1984, pp. 24-42.
5. A. Blass, Y. Gurevich, and J.V. Den Bussche, Abstract state machines and computationally complete query languages, Information and Computation, An abridged version appeared in Abstract State Machines: Theory and Applications, (Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors), Lecture Notes in Computer Science, vol. 1912, Spinger-Verlag, 2000, pp. 22-33.
6. A. Blass, Y. Gurevich, and S. Shelah, Choiceless polynomial time, Annals of Pure and Applied Logic, vol. 100 (1999), pp. 141-187.
7. B. Bollobás, Graph Theory: An Introductory Course, Springer-Verlag, 1979.
8. J.Y. Cai, M. Fürer, and N. Immerman, An optimal lower bound on the number of variables for graph identification, Combinatorica, vol. 12 (1992), pp. 389-410.
9. A. Chandra and D. Harel, Structure and complexity of relational queries, Journal of Computer and System Sciences, vol. 25 (1982), pp. 99-128.
10. F. Gire and H.K. Hoang, An extension of fixpoint logic with a symmetry-based choice construct, Information and Computation, vol. 144 (1998), pp. 40-65.
11. E. Grädel and Y. Gurevich, Metafinite model theory, Information and Computation, vol. 140 (1998), pp. 26-81.
12. Y. Gurevich, Logic and the challenge of computer science, Current trends in theoretical computer science (E. Börger, editor), Computer Science Press, 1988, pp. 1-57.
13. _, Evolving algebras 1993: Lipari guide, Specification and validation methods (E. Börger, editor), Oxford University Press, 1995, pp. 9-36.
14. _, From invariants to canonization, Bulletin of the European Association on Theoretical Computer Science, vol. 63 (1997), Also as Logic in Computer Science, in Current trends in theoretical computer science: Entering the 21st century, (G. Paun, G. Rozenberg and A. Salomaa, editors), World Scientific, 2001, pp. 233-436.
15. _, From invariants to canonization, Bulletin of the European Association on Theoretical Computer Science, vol. 63 (1997), Also as Logic in Computer Science, in Current trends in theoretical computer science: Entering the 21st century, (G. Paun, G. Rozenberg and A. Salomaa, editors), World Scientific, 2001, pp. 233-436.
16. Y. Gurevich and S. Shelah, On finite rigid structures, this Journal, vol. 61 (1996), pp. 549-562.
17. J.K. Huggins, ASM Michigan Web page, http://www.eecs.umich.edu/gasm/.
18. N. Immerman, Relational queries computable in polynomial time, Information and Control, vol. 68 (1986), pp. 86-104.
19. M. Otto, Bounded variable logics and counting: A study infinite models, Lecture Notes in Logic, vol. 9, Springer-Verlag, 1997.
20. S. Shelah, Choiceless polynomial time logic: Inability to express, Computer Science Logic 2000 (P. Clote and H. Schwichtenberg, editors), Lecture Notes in Computer Science, vol. 1862, Springer-Verlag, 2000, paper number 634, pp. 72-125.
21. th ACM Symposium on Theory of Computing, 1982, pp. 137-146.