Abstract
An analogy between functional dependencies and implicational formulas of sentential logic has been discussed in the literature. We feel that a somewhat different connexion between dependency theory and sentential logic is suggested by the similarity between ‘Armstrong's axioms’ for functional dependencies and Tarski's defining conditions for consequence relations, and we pursue aspects of this other analogy here for their theoretical interest. The analogy suggests, for example, a different semantic interpretation of consequence relations: instead of thinking ofB as a consequence of a set of formulas {A1,...,A n} whenB is true on every assignment of truth-values on which eachA i is true, we can think of this relation as obtaining when every pair of truth-value assignments which give the same truth-values toA 1, the same truth-values toA 2,..., and the same truth-values toA n, also make the same assignment in respect ofB. We describe the former as the consequence relation ‘inference-determined’ by the class of truth-value assignments (valuations) under consideration, and the latter as the consequence relation ‘supervenience-determined’ by that class of assignments. Some comparisons will be made between these two notions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Armstrong, W.W., 1974, “Dependency structures of data base relationships,” pp. 380–383 inInformation Processing 74 (Procs. IFIP Congress '74), J.L. Rosenfeld, ed., Amsterdam: North-Holland.
Berman, J. and Blok, W.J., 1988, “Positive Boolean dependencies,”Information Processing Letters 27, 147–150.
Carnap, R., 1943,Formalization of Logic reprinted inIntroduction to Semantics and Formalization of Logic, 1961, Cambridge, MA: Harvard University Press.
Ceeri, S., Gottlob, G. and Pelagatti, G., 1986, “Taxonomy and formal properties of distributed joins,”Information Systems 11, 25–40.
Demetrovics, J., Libkin, L.O. and Muchnik, I.B., 1989, “Functional dependencies and semilattices of closed classes,” pp. 136–147 inMFDBS 89 (2nd Symposium on Mathematical Fundamentals of Database Systems),Lecture Notes in Computer Science #364, J. Demetrovics and B. Thalheim, eds., Berlin: Springer-Verlag.
Fagin, R., 1977, “Functional dependencies in a relational database and propositional logic,”IBM Journal of Research and Development 21, 534–544.
Fagin, R., 1982, “Horn clauses and database dependencies,”Journal of the ACM 29, 953–985.
Fagin, R. and Vardi, M.V., 1984, “The theory of data dependencies — An overview,” pp. 1–22 inAutomata, Languages and Programming, Lecture Notes in Computer Science #172, J. Paredaens, ed., Berlin: Springer-Verlag.
van Fraassen, B.C., 1971,Formal Semantics and Logic, New York: Macmillan.
Kim, J., 1984, “Concepts of supervenience,”Philosophy and Phenomenological Research 45, 153–176.
Lewis, D.K., 1983, “New work for a theory of universals,”Australian Journal of Philosophy 61, 343–377.
Lewis, D.K., 1988, “Statements partly about observation,”Philosophical Papers 17, 1–31.
Maier, D., 1983,The Theory of Relational Databases, Rockville, MA: Computer Science Press.
MatÚš, F, 1991, “Abstract functional dependency structures,”Theoretical Computer Science 81, 117–126.
Pawlak, Z., 1981, “Information systems: Theoretical foundations,”Information Systems 6, 205–218.
Rauszer, C.M., 1984, “An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic,” pp. 298–317 inComputation Theory, Lecture Notes in Computer Science #208, A. Skowron, ed., Berlin: Springer-Verlag.
Rauszer, C.M., 1985, “An equivalence between theory of functional dependencies and a fragment of intuitionistic logic,”Bulletin of the Polish Academy of Sciences (Math.)33, 571–579.
Rauszer, C.M., 1986, “Remarks on logic for dependencies,”Bulletin of the Polish Academy of Sciences (Math.)34, 249–252.
Sadri, F. and Ullman, J.D., 1982, “Template dependencies: A large class of dependencies in relational databases and its complete axiomatization,”Journal of the ACM 29, 363–372.
Sagiv, Y., Delobel, C., Parker, D.S. and Fagin, R., 1981, “An equivalence between relational database dependencies and a fragment of propositional logic,”Journal of the ACM 28, 435–453; Correction, 1987,ibid.34, 1016–1018.
Scott, D.S., 1974, “Completeness and axiomatizability in many-valued logic,” pp. 188–197 inProceedings of the Tarski Symposium, L. Henkinet al., eds., Providence, RI: American Math. Soc.
Scott, D.S., 1974, “Rules and derived rules,” pp. 147–161 inLogical Theory and Semantic Analysis, S. Stenlund, ed., Dordrecht: Reidel.
Shoesmith, D.J. and Smiley, T.J., 1978,Multiple-Conclusion Logic, Cambridge: Cambridge University Press.
Tarski, A., 1956, “On some fundamental concepts of metamathematics,” Chapter III inLogic, Semantics, Metamathematics (tr. J.H. Woodger), Oxford: Clarendon Press (paper originally publ. 1930).
Teller, P., 1985, “A poor man's guide to supervenience and determination,”Southern Journal of Philosophy 22 (Supplement: Spindel Conference), 137–167.
Ullman, J.D., 1980,Principles of Database Systems, Rockville, MA: Computer Science Press.
Ullman, J.D., 1988,Principles of Database and Knowledge-Base Systems, Vol. 1, Rockville, MA: Computer Science Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Humberstone, I.L. Functional dependencies, supervenience, and consequence relations. J Logic Lang Inf 2, 309–336 (1993). https://doi.org/10.1007/BF01181684
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01181684