Relativized logspace and generalized quantifiers over finite ordered structures

Journal of Symbolic Logic

Volumn 62, Issue 2, 1997, Pages 545-574

  Gottlob, Georg ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Bounded queries; Complexity; Expressive power; Finite model theory; Finite structures; Generalized quantifiers; Henkin quantifiers; Logarithmic space; Logspace; Oracles; Relativization

Indexed keywords

EID: 0031477914     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275546     Document Type: Article

References (43)

1. J. BALCÁZAR, J. DIAZ, and J. GABARRÓ, Structural complexity I, Springer-Verlag, 1988.
2. A. BLASS and Y. GUREVICH, Henkin quantifiers and complete problems, Annals of Pure and Applied Logic, vol. 32 (1986), pp. 1-16.
3. J. BUSS, Relativized alternation and space-bounded computation, Journal of Computer and System Sciences, vol. 36 (1988), pp. 351-378.
4. R. CHANG and J. KADIN, On computing Boolean connectives of characteristic functions, Mathematical Systems Theory, vol. 28 (1995), no. 3, pp. 173-198.
5. E. DAHLHAUS, Reductions to NP complete problems by interpretations., Logics and machines, decision problems and complexity, Lecture Notes in Computer Science, vol. 171, Springer-Verlag, 1983.
6. A. DAWAR, Generalized quantifiers and logical reducibilities., Journal of Logic and Computation, vol. 5 (1995), no. 2, pp. 213-226.
7. H. D. EBBINGHAUS, Extended logics: The general framework, Model-theoretic logics. Perspectives of Mathematical Logic, Ch. 2, Springer-Verlag, 1985.
8. H. D. EBBINGHAUS, J. FLUM, and W. THOMAS, Mathematical logic, Springer-Verlag, 1980.
9. H. ENDERTON, Finite partially ordered quantifiers., Z. Math. Logik, vol. 16 (1970), pp. 393-397.
10. R. FAGIN, Generalized first-order spectra and polynomial-time recognizable sets, Complexity of computation, AMS, 1974, pp. 43-74.
11. E. GRÄDEL, On logical descriptions of some concepts in structural complexity theory, Proceedings of the 3rd Workshop on Computer Science Logic, CSL'89, Kaiserslautern, FRG, October 2-6, 1989, Lecture Notes in Computer Science, vol. 440, Springer-Verlag, 1990.
12. Y. GUREVICH, Logic and the challenge of computer science, Current trends in theoretical computer science, Computer Science Press, 1988, pp. 1-57.
13. P. HÁJEK, Generalized quantifiers and finite sets, Prace Naukowe Instytutu Matematyki Politechniki Wrocławskiej, vol. 14 (1977), pp. 91-104, Proc. of the Autumn School in Set Theory and Hierarchy Theory, Karpacz, Poland, September, 1974.
14. P. HÁJEK, Generalized quantifiers and finite sets, Prace Naukowe Instytutu Matematyki Politechniki Wrocławskiej, vol. 14 (1977), pp. 91-104, Proc. of the Autumn School in Set Theory and Hierarchy Theory, Karpacz, Poland, September, 1974.
15. P. HÁJEK and T. HAVRÁNEK, Mechanizing hypothesis formation, Springer-Verlag, Berlin, Heidelberg, New York, 1978.
16. L. HELLA, Definability hierarchies of generalized quantifiers, Annals of Pure and Applied Logic, vol. 43 (1989), pp. 235-271.
17. _, Logical hierarchies in PTIME, Proceedings of the 7th IEEE Symp. on Logic in Computer Science, 1992, pp. 360-368.
18. L. HENKIN, Some remarks on infinitely long formulas, Infinitistic Methods, Proc. of the Symp. on Foundations of Mathematics, Warsaw, Panstwowe, Wydawnictwo, Naukowe and Pergamon Press, 1961, pp. 167-183.
19. N. IMMERMAN, Languages that capture complexity classes, SIAM Journal on Computing, vol. 16 (1987), pp. 760-778.
20. _, Nondeterministic space is closed under complementation, SIAM Journal on Computing, vol. 17 (1988), pp. 935-939.
21. D. JOHNSON, A catalog of complexity classes, Handbook of theoretical computer science, vol. I, Chapter 2, Elsevier Science Publishers B.V. (North Holland), 1990, pp. 67-161.
22. PH. G. KOLAITIS and J. A. VÄÄNÄNEN, Generalized quantifiers and pebble games on finite structures, Annals of Pure and Applied Logic, vol. 74 (1995), pp. 23-75.
23. R. LADNER and N. LYNCH, Relativization of questions about log-space reducibility, Math. Systems Theory, vol. 10 (1976), pp. 19-32.
24. R. LADNER, N. LYNCH, and A. SELMAN, A comparison of polynomial-time reducibilities, Theoretical Computer Science, vol. 1 (1975), pp. 103-123.
25. K. J. LANGE, Nondeterministic log-space reductions, Proceedings of the 11th Symposium on Mathematical Foundations of Computer Science (MFCS'84), Lecture Notes in Computer Science, vol. 176, Springer-Verlag, 1984, pp. 378-388.
26. P. LINDSTRÖM, First order predicate logic with generalized quantifiers, Theoria, vol. 32 (1966), pp. 186-195.
27. _, On extensions of elementary logic, Theoria, vol. 35 (1969), pp. 1-11.
28. NANCY LYNCH, Log space machines with multiple oracle tapes, Theoretical Computer Science, vol. 6 (1978), pp. 25-39.
29. J. A. MAKOWSKY and Y. B. PNUELI, Logics capturing complexity classes uniformly, to appear in Logic and Computational Complexity, D. Leivant (editor), Springer-Verlag, Lecture Notes in Computer Science, Berlin, Heidelberg, New York, 1995.
30. _, Computable quantifiers and logics over finite structures, to appear; preliminary version: TR768, Dept. of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel, 1993.
31. _, Oracles and quantifiers, Computer science logic, refereed papers from csl'93, Lecture Notes in Computer Science, vol. 832, Springer-Verlag, 1994, pp. 198-222.
32. NOAM NISAN and AMNON TA-SHMA, Symmetric logspace is closed under complement, Chicago Journal of Theoretical Computer Science, vol. 1995 (1995), article 1.
33. MITSUNORI OGIWARA, Generalized theorems on relationships among reducibility notions to certain complexity classes, Mathematical Systems Theory, vol. 27 (1994), pp. 189-200.
34. IAIN A. STEWART, Comparing the expressibility of languages formed using NP-complete operators, Journal of Logic and Computation, vol. 1 (1991), no. 3, pp. 305-330.
35. _, Complete problems involving Boolean labelled structures and projection transactions, Journal of Logic and Computation, vol. 1 (1991), no. 6, pp. 861-882.
36. _, Using the Hamilton path operator to capture NP, Journal of Computer and System Sciences, vol. 45 (1992), pp. 127-151.
37. _, Logical characterization of bounded query classes I: Logspace oracle machines, Fundamenta Informaticae, vol. 18 (1993), pp. 65-92.
38. _, Logical characterization of bounded query classes II: Polynomial-time oracle machines, Fundamenta Informaticae, vol. 18 (1993), pp. 93-105.
39. R. SZELEPCSÈNYI, The method of forced enumeration for nondeterministic automata, Acta Informatica, vol. 26 (1988), pp. 279-284.
40. KLAUS WAGNER, Bounded query classes, SIAM Journal on Computing, vol. 19 (1990), no. 5, pp. 833-846.
41. WILBUR WALKOE, Finite partially-ordered quantification, this JOURNAL, vol. 35 (1970), pp. 535-555.
42. C. B. WILSON, Relativized NC, Mathematical Systems Theory, vol. 20 (1987), pp. 13-29.
43. _, On the decomposability of NC and AC, SIAM Journal on Computing, vol. 19 (1990), no. 2, pp. 384-396.