First-order logic with two variables and unary temporal logic

Information and Computation

Volumn 179, Issue 2, 2002, Pages 279-295

  Etessami, Kousha ^a   Vardi, Moshe Y ^b   Wilke, Thomas ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b Rice University   (United States)

^c RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROBLEM SOLVING; THEOREM PROVING;

TEMPORAL LOGIC;

FORMAL LOGIC;

EID: 0037115246     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2953     Document Type: Conference Paper

References (15)

1. [EW96] Etessami, K., and Wilke, Th. (1996), An until hierarchy for temporal logic, in "11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey," pp. 108-117.
2. [Fü84] Fürer, M. (1984), The computational complexity of the unconstrained domino problem (with implications for logical decision problems), in "Logic and Machines: Decision Problems and Complexity," Lecture Notes in Computer Science, Vol. 171, pp. 312-319, Springer-Verlag, Berlin.
3. [GHR94] Gabbay, D.M., Hodkinson, I., and Reynolds, M. (1994), "Temporal Logic," Vol. 1, Clarendon Press, Oxford.
4. [GPSS80] Gabbay, D.M., Pnueli, A., Shelah, S., and Stavi, J. (1980), On the temporal analysis of fairness, in "Conference Record of the 7th Annual ACM Symposium on Principles of Programming Languages, Las Vegas, NV," pp. 163-173.
5. [GKV97] Grädel, E., Kolaitis, Ph.G., and Vardi, M.Y. (1997), On the decision problem for two-variable first-order logic, Bull. Assoc. Symbolic Logic 3, 53-69.
6. [IK89] Immerman, N., and Kozen, D. (1989), Definability with bounded number of bound variables, Inform. and Comput. 83, 121-139.
7. [Kam68] Kamp, J.A.W. (1968), "Tense Logic and the Theory of Linear Order," Ph.D. thesis, University of California, Los Angeles.
8. [Le80] Lewis, H.R. (1980), Complexity results for classes of quantificational formulas, J. Comput. System Sci. 21, 317-353.
9. [MP92] Manna, Z., and Pnueli, A. (1992), "The Temporal Logic of Reactive and Concurrent Systems," Springer-Verlag, Berlin/New York.
10. [Mor74] Mortimer, M. (1975), On languages with two variables, Z. Math. Logik Grundlag. Math. 21, 135-140.
11. [Pnu77] Pnueli, A. (1977), The temporal logic of programs, in "Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, RI," pp. 46-57.
12. [SC85] Sistla, A.P., and Clarke, E.M. The complexity of propositional linear temporal logics, J. Assoc. Comput. Mach. 32, 733-749.
13. [Sto74] Stockmeyer, L.J. (1974), "The Complexity of Decision Problems in Automata Theory and Logic," Ph.D. thesis, Department of Electrical Engineering, MIT.
14. 2, in "Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC), Dallas, Texas," pp. 41-47.
15. [VW86] Vardi, M.Y., and Wolper, P. (1986), An automata-theoretic approach to automatic program verification, in "Proceedings of the First Annual IEEE Symposium on Logic in Computer Science, Cambridge, MA," pp. 322-331.