A Finite Axiomatization of G-Dependence

Preprint English OPEN
Paolini, Gianluca (2015)
  • Subject: 03B70, 03B99 | Mathematics - Logic

We show that a form of dependence known as G-dependence (originally introduced by Grelling) admits a very natural finite axiomatization, as well as Armstrong relations. We also give an explicit translation between functional dependence and G-dependence.
  • References (11)
    11 references, page 1 of 2

    [1] William Ward Armstrong. Dependency Structures of Database Relationships. In: IFIP Congress, pp. 580-583, 1974.

    [2] Catriel Beeri, Martin Dowd, Ronald Fagin and Richard Statman. On the Structure of Armstrong Relations for Functional Dependencies. J. ACM, 31(1):30-46, 1984.

    [3] Catriel Beeri, Ronald Fagin and John H. Howard. A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations. In: SIGMOD '77 Proceedings, pp. 47- 61, 1977.

    [4] Kurt Grelling. A Logical Theory of Dependence. Included in: Barry Smith, editor. Foundations of Gestalt Theory. Philosophia, Munich and Vienna, 1988.

    [5] Wilfrid Hodges. Compositional Semantics for a Logic of Imperfect Information. Log. J. IGPL, 5:539-563, 1997.

    [6] Tapani Hyttinen, Gianluca Paolini and Jouko V¨a¨an¨anen. A Logic for Arguing About Probabilities in Measure Teams. To appear in Arch. Math. Logic.

    [7] Tapani Hyttinen, Gianluca Paolini, and Jouko V¨a¨an¨anen. Quantum Team Logic and Bell's Inequalities. Rev. Symb. Log., 08(04):722-742, 2015.

    [8] Gianluca Paolini and Jouko V¨a¨an¨anen. Dependence Logic in Pregeometries and ω-Stable Theories. J. Symb. Log., 81(01):32-55, 2016.

    [9] Bernhard Thalheim. Dependencies in Relational Databases. Teubner-Texte zur Mathematik, 1991.

    [10] Jouko V¨a¨an¨anen. Dependence Logic. Cambridge University Press, London, 2007.

  • Similar Research Results (2)
  • Metrics
    No metrics available
Share - Bookmark