Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs

Annals of Pure and Applied Logic

Volumn 152, Issue 1-3, 2008, Pages 31-50

  Dawar, Anuj ^a   Richerby, David ^b   Rossman, Benjamin ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF ATHENS   (Greece)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Choiceless polynomial time; Counting quantifiers; Descriptive complexity; Finite model theory

Indexed keywords

EID: 39549107541     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2007.11.011     Document Type: Article

References (20)

1. Blass A., Gurevich Y., and Shelah S. Choiceless polynomial time. Annals of Pure and Applied Logic 100 1-3 (1999) 141-187
2. Blass A., Gurevich Y., and Shelah S. On polynomial time computation over unordered structures. Journal of Symbolic Logic 67 3 (2002) 1093-1125
3. Cai J.-Y., Fürer M., and Immerman N. An optimal lower bound on the number of variables for graph identification. Combinatorica 12 4 (1992) 389-410
4. Dawar A., and Richerby D.M. A fixed-point logic with symmetric choice. Proc. 17th Workshop on Computer Science Logic. LNCS vol. 2803 (2003), Springer 169-182
5. Dawar A., and Richerby D.M. Fixed-point logics with nondeterministic choice. Journal of Logic and Computation 13 4 (2003) 503-530
6. Dawar A., Richerby D.M., and Rossman B. Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (extended abstract). Proc. 12th Workshop on Logic, Language, Information and Computation. ENTCS vol. 143 (2005), Elsevier 13-26
7. Ebbinghaus H.-D., and Flum J. Finite Model Theory. 2nd edition (1999), Springer
8. Fagin R. Generalized first-order spectra and polynomial-time recognizable sets. In: Karp R.M. (Ed). Complexity of Computation. SIAM-AMS Proceedings vol. 7 (1974) 43-73
9. Flum J., and Grohe M. On fixed-point logic with counting. Journal of Symbolic Logic 65 2 (2000) 777-787
10. Gire F., and Hoang H. An extension of fixpoint logic with a symmetry-based choice construct. Information and Computation 144 1 (1998) 40-65
11. Grädel E., and Otto M. Inductive definability with counting on finite structures. Selected papers from 6th Workshop on Computer Science Logic. LNCS vol. 702 (1993), Springer 231-247
12. Gurevich Y. Evolving algebra 1993: Lipari guide. In: Börger E. (Ed). Specification and Validation Methods (1995), Oxford University Press 9-36
13. Gurevich Y., and Shelah S. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic 32 (1986) 265-280
14. Hella L. Logical hierarchies in PTIME. Information and Computation 129 1 (1996) 1-19
15. Immerman N. Relational queries computable in polynomial time. Information and Control 68 1-3 (1986) 86-104
16. Immerman N. Descriptive Complexity (1999), Springer
17. Kolaitis P.G., and Vardi M.Y. Infinitary logics and 0-1 laws. Information and Computation 98 2 (1992) 258-294
18. S. Kreutzer, Expressive equivalence of least and inflationary fixed-point logic, in: Proc. 17th IEEE Symp. on Logic in Computer Science, LICS, 2002, pp. 403-410
19. Otto M. Bounded Variable Logics and Counting. Lecture Notes in Logic vol. 9 (1997), Springer
20. M.Y. Vardi, The complexity of relational query languages, in: Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 137-146