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. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Ferrarotti, F. A., Grosso, A. L., & Turull-Torres, J. M. (2013). Semantic restrictions over second-order logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7693 LNCS, pp. 174–197). Springer Verlag. https://doi.org/10.1007/978-3-642-36008-4_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
