Infinitary logics and 0–1 laws
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Infinitary logic and inductive definability over finite structures
Information and Computation
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
Computing with infinitary logic
ICDT '92 Selected papers of the fourth international conference on Database theory
Information and Computation
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
Reflective relational machines
Information and Computation
A study of homogeneity in relational databases
Annals of Mathematics and Artificial Intelligence
Relational Databases and Homogeneity in Logics with Counting
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Fixed-Point Logics on Planar Graphs
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Equivalence in finite-variable logics is complete for polynomial time
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Annals of Mathematics and Artificial Intelligence
Semantic classifications of queries to relational databases
Proceedings of the 2nd international conference on Semantics in databases
First-Order Types and Redundant Relations in Relational Databases
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Hi-index | 0.00 |
We define a new hierarchy in the class of computable queries to relational databases, in terms of the preservation of equality of theories in fragments of first order logic with bounded number of variables with the addition of counting quantiflers (Ck). We prove that the hierarchy is strict, and it turns out that it is orthogonal to the TIME-SPACE hierarchy defined with respect to the Turing machine complexity. We introduce a model of computation of queries to characterize the different layers of our hierarchy which is based on the reflective relational machine of S. Abiteboul, C. Papadimitriou, and V. Vianu. In our model the databases are represented by their Ck theories. Then we define and study several properties of databases related to homogeneity in Ck getting various results on the change in the computation power of the introduced machine, when working on classes of databases with such properties. We study the relation between our hierarchy and a similar one which we defined in a previous work, in terms of the preservation of equality of theories in fragments of first order logic with bounded number of variables, but without counting quantifiers (FOk). Finally, we give a characterization of the layers of the two hierarchies in terms of the infinitary logics C∞ωk and L∞ωk, respectively.