Fixed-point logics with nondeterministic choice

Journal of Logic and Computation

Volumn 13, Issue 4, 2003, Pages 503-530

  Dawar, Anuj ^a   Richerby, David ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Complexity theory; Finite model theory; Fixed point logics; Nondeterminism; Polynomial time computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; POLYNOMIALS; SEMANTICS;

FINITE MODEL THEORY;

FORMAL LOGIC;

EID: 0042364983     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/13.4.503     Document Type: Article

References (19)

1. S. Abiteboul, M. Y. Vardi, and V. Vianu. Fixpoint logics, relational machines, and computational complexity. In Proceedings of the Seventh Annual IEEE Symposium on Structure in Complexity Theory, pp. 156-168. IEEE Computer Society Press, 1992.
2. V. Arvind and S. Biswas. Expressibility of first order logic with a nondeterministic inductive operator. In Proceedings of the Fourth Annual Symposium on Theoretical Aspects of Computer Science, volume 247 of Lecture Notes in Computer Science, pp. 323-335. Springer-Verlag, 1987.
3. A. R. Blass and Y. Gurevich. The logic of choice. Journal of Symbolic Logic, 65, 1264-1310, 2000.
4. A. K. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25, 99-128, 1982.
5. A. Dawar and Y. Gurevich. Fixed point logics. Bulletin of Symbolic Logic, 8, 65-88, 2002.
6. H.-D. Ebbinghaus. Extended logics: The general framework. In Model-Theoretic Logics, J. Barwise and S. Feferman, eds, pp. 25-76. Springer-Verlag, 1985.
7. H.-D. Ebbinghaus and J. Flum. Finite Model Theory, 2nd edn. Springer-Verlag, 1999.
8. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, volume 7 of SIAM-AMS Proceedings, R. Karp, ed. pp. 43-73. SIAM-AMS, 1974.
9. J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6, 675-695, 1977.
10. F. Gire and H. K. Hoang. An extension of fixpoint logic with a symmetry-based choice construct. Information and Computation, 144, 40-65, 1998.
11. S. Greco, D. Saccà, and C. Zaniolo. Extending stratified datalog to capture complexity classes ranging from ℘ to script Q sign ℋ. Acta Informatica, 37, 699-725, 2001.
12. Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Journal of Pure and Applied Logic, 32, 265-280, 1986.
13. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68, 86-104, 1986.
14. Y. N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974.
15. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
16. B. A. Trakhtenbrot. Impossibility of an algorithm for the decision problem in finite classes (Russian), Doklady Akademii Nauk SSSR, 70, 569-572, 1950. English translation: American Mathematical Society, Translations, Series 2, 23, 1-5, 1963.
17. B. A. Trakhtenbrot. Impossibility of an algorithm for the decision problem in finite classes (Russian), Doklady Akademii Nauk SSSR, 70, 569-572, 1950. English translation: American Mathematical Society, Translations, Series 2, 23, 1-5, 1963.
18. L. G. Valiant. Relative complexity of checking and evaluating. Information Processing Letters, 5, 20-23, 1976.
19. M. Y. Vardi. Complexity of relational query languages, In Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 137-146, 1982.