Abstract
We review several semantic restrictions to second-order quantification proposed in the literature. Our focus is on the expressibility and complexity over finite models, or equivalently relational databases, of the second-order logics obtained under those semantic restrictions. We also provide new insights and results in this topic.
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
Abiteboul, S., Vianu, V.: Datalog extensions for database queries and updates. Journal of Computer and System Sciences 43, 62–124 (1991)
Abiteboul, S., Vardi, M., Vianu, V.: Fixpoint logics, relational machines, and computational complexity. Journal of ACM 44, 30–56 (1997)
Barwise, J.: On Moschovakis closure ordinals. Journal of Symbolic Logic 42, 292–296 (1977)
Cadoli, M., Schaerf, M.: On the complexity of Entailment in Propositional Multivalued Logics. Annals of Mathematics and Artificial Intelligence (AMAI) 18, 29–50 (1996)
Cai, J., Fürer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12(4), 389–410 (1992)
Dawar, A.: A Restricted Second Order Logic for Finite Structures. Information and Computation 143, 154–174 (1998)
Dawar, A.: Feasible Computation through Model Theory. Ph.D. thesis, University of Pennsylvania (1993)
Durand, A., Lautemann, C., Schwentick, T.: Subclasses of Binary NP. Journal of Logic and Computation 8(2), 189–207 (1998)
Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R.M. (ed.) Complexity of Computation. SIAM-AMS Proceedings, vol. 7, pp. 43–73 (1974)
Ferrarotti, F.A., Paoletti, A.L., Turull-Torres, J.M.: Redundant Relations in Relational Databases: A Model Theoretic Perspective. Journal of Universal Computer Science 16(20), 2934–2955 (2010)
Ferrarotti, F.A., Turull Torres, J.M.: The Relational Polynomial-Time Hierarchy and Second-Order Logic. In: Schewe, K.-D., Thalheim, B. (eds.) SDKB 2008. LNCS, vol. 4925, pp. 48–76. Springer, Heidelberg (2008)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co. (1979) ISBN 0-7167-1045-5
Grohe, M.: Finite variable logics in descriptive complexity theory. Bulletin of Symbolic Logic 4(4), 345–398 (1998)
Grosso, A.L., Turull-Torres, J.M.: A Second-Order Logic in which Variables Range over Relations with Complete First-Order Types. In: 2010 XXIX International Conference of the Chilean Computer Science Society, SCCC, pp. 270–279. IEEE (2010)
Grosso, A.L., Turull-Torres, J.M.: SOF: A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy. In: Düsterhöft, A., Klettke, M., Schewe, K.-D. (eds.) Conceptual Modelling and Its Theoretical Foundations. LNCS, vol. 7260, pp. 116–135. Springer, Heidelberg (2012)
Gurevich, Y., Shela, S.: Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic 32, 165–180 (1986)
Gurevich, Y., Shela, S.: On finite rigid structures. Journal of Symbolic Logic 61 (1996)
Immerman, N.: Relational queries computable en polynomial time. Information and Control 68, 86–104 (1986)
Immerman, N.: Descriptive and computational complexity. In: Hartmanis, J. (ed.) Computational Complexity Theory. Proc. of AMS Symposia in Appl. Math., vol. 38, pp. 75–91 (1989)
Immerman, N.: Descriptive Complexity. Springer (1998) ISBN 0-387-98600-6
Kolaitis, P., Vardi, M.: Infinitary logics and 0-1 laws. Information and Commputation 98(2), 258–294 (1992)
Kolaitis, P., Väänänen, J.: Generalized quantifiers and pebble games on finite structures. Annals of Pure and Applied Logic 74(1), 23–75 (1995)
Lautemann, C., Schwentick, T., Thérien, D.: Logics for Context-Free Languages. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 205–216. Springer, Heidelberg (1995)
Libkin, L.: Elements of Finite Model Theory. Springer (2004) ISBN 3-5402-1202-7
Otto, M.: The expressive power of fixed-point logic with counting. Journal of Symbolic Logic 61(1), 147–176 (1996)
Otto, M.: Bounded variable logics and counting – A study in finite models, vol. 9. Springer, Heidelberg (1997)
Papadimitriou, C.: Computational Complexity. Addison-Wesley (1993) ISBN 0-2015-3082-1
Stockmeyer, L.: The polynomial-time hierarchy. Theoretical Computer Science 3, 1–22 (1976)
Turull-Torres, J.M.: A study of homogeneity in relational databases. Annals of Mathematics and Artificial Intelligence 33(2-4), 379–414 (2001); See also: Erratum for: A Study of Homogeneity in Relational Databases. Annals of Mathematics and Artificial Intelligence 33(2) 379–414 (2001), Annals of Mathematics and Artificial Intelligence 42, 443–444 (2004)
Turull-Torres, J.M.: Relational databases and homogeneity in logics with counting. Acta Cybernetica 17(3), 485–511 (2006)
Vardi, M.Y.: The complexity of relational query languages. In: Proc. 14th ACM Symposium on the Theory of Computing, pp. 137–146 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrarotti, F.A., Grosso, A.L., Turull-Torres, J.M. (2013). Semantic Restrictions over Second-Order Logic. In: Schewe, KD., Thalheim, B. (eds) Semantics in Data and Knowledge Bases. SDKB 2011. Lecture Notes in Computer Science, vol 7693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36008-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-36008-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36007-7
Online ISBN: 978-3-642-36008-4
eBook Packages: Computer ScienceComputer Science (R0)