Abstract
We introduce a restricted version of second order logic SOω in which the second order quantifiers range over relations that are closed under the equivalence relation ≡k of k variable equivalence, for some k. This restricted second order logic is an effective fragment of the infinitary logic L ωαω , which differs from other such fragments in that it is not based on a fixpoint logic. We explore the relationship of SOω with fixpoint logics, showing that its inclusion relations with these logics are equivalent to problems in complexity theory. We also look at the expressibility of NP-complete problems in this logic.
Supported by EPSRC grant GR/H 81108.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Abiteboul, Moshe Y. Vardi, and V. Vianu. Fixpoint logics, relational machines, and computational complexity. In Proc. 7th IEEE Symp. on Structure in Complexity Theory, 1992.
S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62–124, 1991.
S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proceedings of the 23rd ACM Symposium on the Theory of Computing, 1991.
J. Barwise. On Moschovakis closure ordinals. Journal of Symbolic Logic, 42:292–296, 1977.
J-y. Cai, M. Fürer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12(4):389–410, 1992.
A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99–128, 1982.
E. Dahlhaus. Reduction to NP-complete problems by interpretation. In LNCS 171, pages 357–365. Springer-Verlag, 1984.
A. Dawar. Feasible Computation through Model Theory. PhD thesis, University of Pennsylvania, 1993.
A. Dawar and E.Grädel. Generalized quantifiers and 0-1 laws. Manuscript, 1994.
A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Technical Report MS-CIS-91-97, University of Pennsylvania, 1991. Revised version to appear in Information and Computation.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol 7, pages 43–73, 1974.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265–280, 1986.
N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76–98, 1982.
N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.
N. Immerman. Descriptive and computational complexity. In J. Hartmanis, editor, Computational Complexity Theory, Proc. of AMS Symposia in Appl. Math., volume 38, pages 75–91, 1989.
Ph. G. Kolaitis and M. Y. Vardi. Fixpoint logic vs. infinitary logic in finite-model theory. In Proc. 7th IEEE Symp. on Logic in Computer Science, pages 46–57, 1992.
Ph. G. Kolaitis and M. Y. Vardi. Infinitary logics and 0-1 laws. Information and Computation, 98(2):258–294, 1992.
D. Leivant. Inductive definitions over finite structures. Information and Computation, 89:95–108, 1990.
L. Lovász and P. Gács. Some remarks on generalized spectra. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 23:27–144, 1977.
Y. N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974.
A.Rubin. Free Algebras in Von Neumann-Bernays-Godel Set Theory and Positive Elementary Inductions in Reasonable Structures. PhD thesis, California Institute of Technology, 1975.
L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1–22, 1976.
M. Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on the Theory of Computing, pages 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dawar, A. (1995). A restricted second order logic for finite structures. In: Leivant, D. (eds) Logic and Computational Complexity. LCC 1994. Lecture Notes in Computer Science, vol 960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60178-3_94
Download citation
DOI: https://doi.org/10.1007/3-540-60178-3_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60178-4
Online ISBN: 978-3-540-44720-7
eBook Packages: Springer Book Archive