Difference between revisions of "Relation"
m (1 revision imported) |
|||
| (7 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
In mathematics, relations are often defined in terms of [[wikipedia:Tuple|Tuple]], or a collection of mathematical objects, contained or defined by the '''relation'''. | In mathematics, relations are often defined in terms of [[wikipedia:Tuple|Tuple]], or a collection of mathematical objects, contained or defined by the '''relation'''. It is also strong related to the notion of [[function]]. | ||
=Ordered relation= | |||
{{:Ordered relation}} | |||
<noinclude> | |||
=References= | |||
<references/> | |||
==Related Pages== | |||
*[[logically related::Function]] | |||
*[[logically related::Tuple]] | |||
</noinclude> | |||
Latest revision as of 09:35, 7 September 2021
In mathematics, relations are often defined in terms of Tuple, or a collection of mathematical objects, contained or defined by the relation. It is also strong related to the notion of function.
Ordered relation
An ordered relation, or a directed relation is the generic building block of Partially ordered sets[1]. It can be visualized as an arrow that relates two objects with an explicit direction. The directionality of a directed relation breaks the symmetry of symbolic representation, which is the smallest amount of information, therefore, directed relations can be used to represent any other kinds of information contentCite error: Invalid <ref> tag; invalid names, e.g. too many. Ordered relations are particularly useful in representing causal relations[2].
Prefix and Postfix Expressions
Since order matters, the sequence of how certain symbols appears in an expression also matters a lot. There are two kinds of expressions:
References
- ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group.
- ↑ Pearl, Judea (2018). The Book of Why: The New Science of Cause and Effect. local page: Basic Books. ISBN 978-0-465-09761-6.