Some characterizations of finitely specifiable implicational dependency families (Q578937): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4052071 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Horn clauses and database dependencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finitely Specifiable Implicational Dependency Families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5815606 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3347338 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90116-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2043408048 / rank | |||
Normal rank |
Latest revision as of 10:57, 30 July 2024
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