scientific article; zbMATH DE number 3986682

From MaRDI portal
Publication:3750154





[For the entire collection see Zbl 0578.00001.] The theory of data dependencies is of special interest for information systems. This paper deals with various aspects of indiscernibility relations (IRs), where an IR is a binary relation that gives objects which have the same information with respect to a set of attributes. The attributes form a relation scheme and elements of a respective relation represent the objects. The author describes the syntax for a logic of IRs (FD-logic) based on Gentzen rules for classical propositional logic and intuitionistic logic. FD-logic is consistent and it enables to prove certain properties of IRs (and functional dependencies). After the introduction, an FD-algebra is developed which connects algebraic properties of IRs with functional dependencies holding in the relation. At the end of the paper two important theorems are proved: 1) FD-logic is sound and complete, 2) FD-logic is not classical logic. The paper is recommended to anyone who prefers the more mathematical treatment of databases.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750154)