Capturing relativized complexity classes without order

Mathematical Logic Quarterly

Volumn 44, Issue 1, 1998, Pages 109-122

  Dawar, Anuj ^a   Gottlob, Georg ^b   Hella, Lauri ^c  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c NONE

Author keywords

Descriptive complexity theory; Finite model theory; Finite structures; Fixpoint logic; Generalized quantifiers; Relativized logspace

Indexed keywords

EID: 0032221655     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.19980440108     Document Type: Article

References (27)

1. ABITEBOUL, S., and V. VIANU, Datalog extensions for database queries and updates. J. Computer System Sci. 43 (1991), 62-124.
2. BARWISE, J., On Moschovakis closure ordinals. J. Symbolic Logic 42 (1977), 292-296.
3. BLASS, A., and Y. GUREVICH, Equivalence relations, invariants, and normal forms. SIAM J. Computing 13 (1984), 682-689.
4. DAWAR, A., Generalized quantifiers and logical reducibilities. J. Logic and Comput. 5 (1995), 213-226.
5. DAWAR and L. HELLA, The expressive power of finitely many generalized quantifiers. Inform. and Comput. 123 (1995), 172-184.
6. EBBINGHAUS, H. D., and J. FLUM, Finite Model Theory. Springer-Verlag, Berlin-Heidelberg-New York 1995.
7. FAGIN, R., Generalized first-order spectra and polynomial-time recognizable sets. In: Complexity of Computation (R. M. KARP, ed.), SIAM-AMS Proceedings 7 (1974), 43-73.
8. GOTTLOB, G., Relativized logspace and generalized quantifiers over ordered finite structures. J. Symbolic Logic (to appear). Short version in: Proc. Tenth Annual Symposium on Logic in Computer Science LICS'95 (San Diego, CA, June 1995), IEEE Computer Society Press 1995, pp. 65-78.
9. GOTTLOB, G., N. LEONE, and H. VEITH, Second order logic and the weak exponential hierarchies. In: Proc. Intern. Symp. on Mathematical Foundations of Computer Science, MFCS'95, Prague (CR); Lecture Notes in Computer Science 969, Springer-Verlag, Berlin-Heidelberg-New York 1995, pp. 66-81.
10. GUREVICH, Y., Toward logic tailored for computational complexity. In: Computation and Proof Theory (M. RICHTER et al., eds.), Lecture Notes in Mathematics 1104, Springer-Verlag, Berlin-Heidelberg-New York 1984, pp. 175-216.
11. GUREVICH, Y., and S. SHELAH, Fixed-point extensions of first-order logic. Annals Pure Appl. Logic 32 (1986), 265-280.
12. HEMACHANDRA, L. A., The strong exponential hierarchy collapses. J. Computer System Sci. 39 (1989), 299-322.
13. HEMASPAANDRA, E., Census techniques collapse sparse classes. Information Processing Letters 51 (1994), 79-84.
14. IMMERMAN, N., Relational queries computable in polynomial time. Information and Control 68, (1986), 86-104.
15. IMMERMAN, N., Nondeterministic space is closed under complementation. SIAM J. Comput. 17 (1988), 935-939.
16. KADIN, J., The polynomial hierarchy collapses if the Boolean Hierarchy collapses. SIAM J. Comput. 17 (1988), 1263-1282.
17. KOLAITIS, PH. G., and M. Y. VARDI, Infinitary logics and 0-1 laws. Inform. and Comput. 98 (1992), 258-294.
18. LADNER, R., and N. LYNCH, Relativization of questions about log-space reducibility. Math. Systems Theory 10 (1976), 19-32.
19. MAKOWSKY, J. A., and Y. B. PNUELI, Oracles and quantifiers. In: Computer Science Logic (CSL'93), Lecture Notes in Computer Science 832, Springer-Verlag, Berlin-Heidelberg-New York 1994, pp. 198-222.
20. MOCAS, S., Separating exponential time classes from polynomial time classes. Ph.D. Thesis, Graduate School, College of Computer Science, Northeastern University, 1993.
21. MOCAS, S., Separating classes in the exponential-time hierarchy from classes in PH. Theoretical Computer Science 185 (1996), 221-231.
22. STEWART, I. A., Logical characterization of bounded query classes I: Logspace oracle machines. Fundamenta Informaticae 18 (1993), 65-92.
23. STEWART, I. A., Logical characterization of bounded query classes II: Polynomial-time oracle machines. Fundamenta Informaticae 18 (1993), 93-105.
24. SZELEPCSÈNYI, R., The method of forced enumeration for nondeterministic automata. Acta Informatica 26 (1988), 279-284.
25. VARDI, M. Y., The complexity of relational query languages. In: Proceedings of the 14th ACM Symposium on the Theory of Computing (1982), pp. 137-146.
26. YAP, C., Some Consequences of non-uniform conditions on uniform classes. Theoretical Computer Science 26 (1983), 287-300.
27. WAGNER, K., Bounded query classes. SIAM J. Comput. 19 (1990), 833-846.