Some characterizations of finitely specifiable implicational dependency families (Q578937): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A theorem analogous to Tarski-Fraisse-Vaught's characterization of universal classes is proved in the following manner: An implicational dependency family over a relation scheme is finitely specifiable if and only if there exists a finite number of relations such that a relation belongs to the dependency family if and only if it has no substructure which is isomorphic to one of the generator relations. Furthermore: A family is finitely specifiable if and only if there exists a natural number k such that a relation belongs to the dependency family whenever the family contains all its substructures of at most k elements. On this basis a new proof for Hull's (1984) characterization is also given. | |||
Property / review text: A theorem analogous to Tarski-Fraisse-Vaught's characterization of universal classes is proved in the following manner: An implicational dependency family over a relation scheme is finitely specifiable if and only if there exists a finite number of relations such that a relation belongs to the dependency family if and only if it has no substructure which is isomorphic to one of the generator relations. Furthermore: A family is finitely specifiable if and only if there exists a natural number k such that a relation belongs to the dependency family whenever the family contains all its substructures of at most k elements. On this basis a new proof for Hull's (1984) characterization is also given. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4014079 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
relational database | |||
Property / zbMATH Keywords: relational database / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
relational dependency | |||
Property / zbMATH Keywords: relational dependency / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
implicational dependency | |||
Property / zbMATH Keywords: implicational dependency / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
relation scheme | |||
Property / zbMATH Keywords: relation scheme / rank | |||
Normal rank |
Revision as of 17:19, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some characterizations of finitely specifiable implicational dependency families |
scientific article |
Statements
Some characterizations of finitely specifiable implicational dependency families (English)
0 references
1986
0 references
A theorem analogous to Tarski-Fraisse-Vaught's characterization of universal classes is proved in the following manner: An implicational dependency family over a relation scheme is finitely specifiable if and only if there exists a finite number of relations such that a relation belongs to the dependency family if and only if it has no substructure which is isomorphic to one of the generator relations. Furthermore: A family is finitely specifiable if and only if there exists a natural number k such that a relation belongs to the dependency family whenever the family contains all its substructures of at most k elements. On this basis a new proof for Hull's (1984) characterization is also given.
0 references
relational database
0 references
relational dependency
0 references
implicational dependency
0 references
relation scheme
0 references