Abstract
In the last 20 years several logics were exhibited which capture complexity classes such as L (LogSpace), NL (Non-deterministic LogSpace), P (Polynomial Time), NP (Non-deterministic Polynomial Time), PH (the polynomial hierarchy), [4, 12, 13, 23, 20] on ordered structures. In mathematical logic the theory of abstract model theory and Lindström quantifiers is well established [2]. In this talk we report our work concerning unification of Descriptive Complexity Theory and Abstract Model Theory. A detailed account has been published in [15, 16, 17]. Similar results with complementary aims have been proven recently by G. Gottlob, [6].
This is a preview of subscription content, log in via an institution to check access.
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
S. Abiteboul, R. Hull, and V. Vianu: Foundations of Database. Addison Wesley, 1994.
J. Barwise and S. Feferman, editors: Model-Theoretic Logics. Perspectives in Mathematical Logic. Springer Verlag, 1985.
J.F. Buss: Alternations and space—bounded computations. Journal of Computer and System Sciences, 36: 351–378, 1988.
R. Fagin: Generalized first-order spectra and polynomial time recognizable sets. In R. Karp, editor, Complexity of Computation, volume 7 of American Mathematical Society Proc, pages 27–41. Society for Industrial and Applied Mathematics, 1974.
M.G. Garey and D.S. Johnson: Computers and Intractability. Mathematical Series. W.H. Freeman and Company, 1979.
G. Gottlob: Relativized logspace and generalized quantifiers over finite structures. Manuscript 1995.
M. Grohe: Linström—quantifiers that capture fixed—point logics. Preprint, 1994.
Y. Gurevich and S. Shelah: Fixed point extensions of first order logic. Annals of Pure and Applied Logic, 32: 265–280, 1986.
Y. Gurevich: Logic and the challenge of computer science. In E. Börger, editor, Trends in Theoretical Computer Science, Principles of Computer Science Series, chapter 1. Computer Science Press, 1988.
L. Hella: Definability hierarchies of generalized quantifiers. Annals of Pure andApplied Logic, 43 (3): 235–271, 1989.
Lauri Hella: Logical hierarchies in PTIME. In LiCS’92, pages 360–368. IEEE, 1992.
N. Immerman: Languages that capture complexity classes. SIAM Journal on Computing, 16 (4): 760–778, Aug 1987.
N. Immerman: Expressibility and parallel complexity. SIAM Journal on Computing, 18: 625–638, 1989.
J.A. Makowsky: Capturing complexity classes with lindström quantifiers. In MFCS’94, volume 841 of Lecture Notes in Computer Science, pages 68–71. Springer Verlag, 1994.
J.A. Makowsky and Y.B. Pnueli: Computable quantifiers and logics over finite structures. To appear in `Quantifiers: Generalizations, extensions and and variants of elementary logic’, Kluwer Academic Publishers, preliminary version TR 768, Department of Computer Science, Technion—Israel Institute of Technology, Haifa, Israel, 1993.
J.A. Makowsky and Y. Pnueli: Logics capturing oracle complexity classes uniformly. in preparation, 1994.
J.A. Makowsky and Y.B. Pnueli: Oracles and quantifiers. In CSL’93, volume 832 of Lecture Notes in Computer Science, pages 189–222. Springer, 1994.
J.A. Makowsky and Y. Pnueli: Second order logics capturing complexity classes. in preparation, 1995.
M. Sipser: On relativization and the existence of complete sets. In ICALP’82, volume 140 of Lecture Notes in Computer Science, pages 523–531. Springer, 1982.
I.A. Stewart: Comparing the expressibility of languages formed using NP—complete operators. Journal of Logic and Computation, 1 (3): 305–330, 1991.
I.A. Stewart: Logical characterizations of bounded query classes I: Logspace oracle machines. Fundamenta Informaticae, 18: 65–92, 1993.
I.A. Stewart: Logical characterizations of bounded query classes II: Polynomial—time oracle machines. Fundamenta Informaticae, 18: 93–105, 1993.
L. Stockmeyer: Classifying the computational complexity of problems. Journal of Symbolic Logic, 52 (1): 1–43, 1987.
C.B. Wilson: Parallel computation and the NC hierarchy relativized. In Structure in Complexity Theory, volume 223 of Lecture Notes in Computer Science, pages 362382. Springer Verlag, 1986.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Makowsky, J.A. (1995). Capturing Relativized Complexity Classes with Lindström Quantifiers. In: Depauli-Schimanovich, W., Köhler, E., Stadler, F. (eds) The Foundational Debate. Vienna Circle Institute Yearbook [1995], vol 3. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-3327-4_10
Download citation
DOI: https://doi.org/10.1007/978-94-017-3327-4_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4617-8
Online ISBN: 978-94-017-3327-4
eBook Packages: Springer Book Archive