Abstract
This paper presents a perspective on the relationship between Lindström quantifiers in model theory and oracle computations in complexity theory. We do not study this relationship here in full generality (indeed, there is much more work to do in order to obtain a full appreciation), but instead we examine what amounts to a thread of research in this topic running from the motivating results, concerning logical characterizations of nondeterministic polynomial-time, to the consideration of Lindström quantifiers as oracles, and through to the study of some naturally arising questions (and subsequent answers). Our presentation follows the chronological progress of the thread and highlights some important techniques and results at the interface between finite model theory and computational complexity theory.
Supported by EPSRC Grant GR/K 96564.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Allender, J. Balcázar and N. Immerman, A first-order isomorphism theorem, Lecture Notes in Computer Science Vol. 665 (1993) 163–174.
A. Blass and Y. Gurevich, Equivalence relations, invariants and normal forms, SIAM J. Comput. 13 (1984) 682–689.
J. Barwise, On Moschovakis closure ordinals, J. Symbolic Logic 42 (1997) 292–296.
J.F. Buss, Alternations and space-bounded computations, J. Comput. Systems Sci. 36 (1988) 351–378.
E. Dahlhaus, Reduction to NP-complete problems by interpretations, Lecture Notes in Computer Science Vol. 171, Springer-Verlag (1984) 357–365.
A. Dawar, Generalized quantifiers and logical reducibilities, J. Logic Computat. 5 (1995) 213–226.
A. Dawar, G. Gottlob and L. Hella, Capturing relativized complexity classes without order, Mathematical Logic Quarterly, 44 (1998) 109–122.
A. Dawar and L. Hella, The expressive power of finitely many generalized quantifiers, Inform. and Computat. 123 (1995) 172–184.
H.D. Ebbinghaus and J. Flum, Finite Model Theory, Springer-Verlag (1995).
R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: Complexity of Computation (ed. R.M. Karp), SIAM-AMS Proceedings 7 (1974) 43–73.
M.R. Garey and D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W.H. Freeman and Co. (1979).
Y.V. Glebskii, D.I. Kogan, M.I. Liogonki and V.A. Talanov, Range and degree of realizability of formulas in the restricted predicate calculus, Cybernetics 5 (1969) 142–154.
E. Grädel, On logical descriptions of some concepts in structural complexity theory, Lecture Notes in Computer Science Vol. 440 (1990) 163–175.
E. Grädel, Capturing complexity classes by fragments of second-order logic, Theoret. Comput. Sci. 101 (1992) 35–57.
G. Gottlob, Relativized logspace and generalized quantifiers over finite ordered structures, J. Symbolic Logic 62 (1997) 545–574.
G. Gottlob, N. Leone and H. Veith, Second order logic and the weak exponential hierarchies, Lecture Notes in Computer Science Vol. 969, Springer-Verlag (1995) 66–81.
Y. Gurevich, Toward logic tailored for computational complexity, Lecture Notes in Mathematics Vol. 1104, Springer-Verlag (1984) 175–216.
Y. Gurevich, Logic and the challenge of computer science, in: Trends in Theoretical Computer Science (ed. E. Börger), Computer Science Press (1988) 1–57.
J. Hartmanis, N. Immerman and S. Mahaney, One-way log-tape reductions, Proc. 19th Symp. Foundations of Computer Science, IEEE Press (1978) 65–71.
N. Immerman, Relational queries computable in polynomial time, Inform. Control 68 (1986) 86–104.
N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760–778.
N. Immerman, Nondeterministic space is closed under complementation, SIAM J. Comput. 17 (1988) 935–938.
J. Köbler, U. Schöning and K.W. Wagner, The difference and the truth-table hierarchies for NP, RAIRO Inform. Theory 21 (1987) 419–435.
P. Lindström, First order predicate logic with generalized quantifiers, Theoria 32 (1966) 186–195.
P. Lindström, On extensions of elementary logic, Theoria 35 (1969) 1–11.
J.A. Makowsky and Y.B. Pnueli, Oracles and quantifiers, Lecture Notes in Computer Science Vol. 832 (1994) 189–222.
J.A. Makowsky and Y. Pnueli, Logics capturing oracle complexity classes uniformly, Lecture Notes in Computer Science Vol.960 (1995) 463–479.
J.A. Makowsky and Y. Pnueli, Computable quantifiers and logics over finite structures, in: Quantifiers: Logics, Models and Computation, Volume 1 (ed. M. Krynicki et al.), Kluwer (1995) 313–357.
W. Savitch, Maze recognizing automata and nondeterministic tape complexity, J. Comput. System Sci. 7 (1973) 389–403.
I.A. Stewart, Comparing the expressibility of languages formed using NP-complete operators, J. Logic Computat. 1 (1991) 305–330.
I.A. Stewart, Using the Hamiltonian path operator to capture NP, J. Comput. System Sci. 45 (1992) 127–151.
I.A. Stewart, Logical characterizations of bounded query classes I: logspace oracle machines, Fund. Informat. 18 (1993) 65–92.
I.A. Stewart, Logical characterizations of bounded query classes II: polynomialtime oracle machines, Fund. Informat. 18 (1993) 93–105.
I.A. Stewart, Methods for proving completeness via logical reductions, Theoret. Comput. Sci. 118 (1993) 193–229.
I.A. Stewart, Logical description of monotone NP problems, J. Logic Computat. 4 (1994) 337–357.
L. Stockmeyer, The polynomial hierarchy, Theoret. Comput. Sci. 3 (1976) 1–22.
R. Szelepcsényi, The method of forced enumeration for nondeterministic automata, Acta Informat. 26 (1988) 279–284.
B.A. Trakhtenbrot, Impossibility of an algorithm for the decision problem on finite classes, Doklady 70 (1950) 569–572.
M. Vardi, Complexity of relational query languages, Proc. 14th ACM Ann. Symp. on Theory of Computing (1982) 137–146.
K.W. Wagner, Bounded query classes, SIAM J. Comput. 19 (1990) 833–846.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stewart, I.A. (1999). A Perspective on Lindström Quantifiers and Oracles. In: Väänänen, J. (eds) Generalized Quantifiers and Computation. ESSLLI 1997. Lecture Notes in Computer Science, vol 1754. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46583-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-46583-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66993-7
Online ISBN: 978-3-540-46583-6
eBook Packages: Springer Book Archive