Difference between revisions of "Grounded relation"
Jon Awbrey (talk | contribs) (Copy content from Wikipedia of which Jon Awbrey is the sole author) |
Jon Awbrey (talk | contribs) (add doc history, add categories) |
||
| Line 14: | Line 14: | ||
* [[Relation theory]] | * [[Relation theory]] | ||
* [[Relation type]] | * [[Relation type]] | ||
| + | |||
| + | ==Document history== | ||
| + | |||
| + | Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders. | ||
| + | |||
| + | * [http://en.wikipedia.org/wiki/Grounded_relation Grounded relation], [http://en.wikipedia.org/ Wikipedia]. | ||
| + | |||
| + | [[Category:Logic]] | ||
| + | [[Category:Mathematics]] | ||
| + | [[Category:Set theory]] | ||
Revision as of 03:06, 9 January 2008
A grounded relation over a sequence of sets is a mathematical object consisting of two components. The first component is a subset of the cartesian product taken over the given sequence of sets, which sets are called the domains of the relation. The second component is just the cartesian product itself.
For example, if L is an grounded relation over a finite sequence of sets, then L has the form L = (F(L), G(L)), where F(L) ⊆ G(L) = X1 × … × Xk, for some positive integer k.
The default assumption in almost all applied settings is that the domains of the grounded relation are nonempty sets, hence departures from this assumption need to be noted explicitly.
See also
- Logic of relatives
- Relation
- Relation composition
- Relation construction
- Relation reduction
- Relation theory
- Relation type
Document history
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.
