An n! Lower Bound on Formula Size

ACM Transactions on Computational Logic

Volumn 4, Issue 3, 2003, Pages 296-314

  Adler, Micah ^a   Immerman, Neil ^a  

^a University of Massachusetts Amherst   (United States)

Author keywords

Descriptive complexity; lower bounds; temporal logic; Theory

Indexed keywords

EID: 85019463009     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/772062.772064     Document Type: Article

References (12)

1. Alechina, N. and Immerman, N. 2000. Reachability logic: An efficient fragment of transitive closure logic. Logic J. IGPL 8, 3, 325-338
2. Clarke, E. M. and Emerson, E. A. 1981. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of the Workshop on Logic of Programs. 52-71
3. Clarke, E. M., Grumberg, O., and Peled, D. 1999. Model Checking. M.I.T. Press, Cambridge, Mass
4. Ehrenfeucht, A. 1961. An application of games to the completeness problem for formalized theories. Fund. Math 49, 129-141
5. Emerson, E. A. 1991. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. M.I.T. Press, Cambridge, Mass., 995-1072
6. Emerson, E. A. and Halpern, J. Y. 1985. Decision procedures and expressiveness in the temporal logic of branching time. J Comput. Syst. Sci. 30, 1, 1-24
7. Fraisse, R. 1954. Sur les classifications des systems de relations. Publ. Sci. Univ. Alger I
8. Immerman, N. 1987. Languages that capture complexity classes. SIAM J. Comput. 16, 4, 760-778.
9. Immehman, N. 1999. Descriptive Complexity. Springer-Verlag, New York
10. Immerman, N. and Vahdi, M. Y. 1997. Model checking and transitive closure logic. In Proceedings of The 9th International Conference on Computer-Aided Verification. Springer-Verlag, 291-302.
11. Karchmer, M. 1989. Communication Complexity: A New Approach to Circuit Depth. M.I.T. Press, Cambridge, Mass
12. Wilke, T. 1999. CTL+ is exponentially more succinct than CTL. In Foundations of Software Technology and Theoretical Computer Science: 19th Conference. 110-121