Difference between revisions of "Ordered relation"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
An [[ordered relation]], or a [[directed relation]] can be considered as the building block of [[Partially ordered set]]s. It can be visualized as an [[arrow]] that relates two [[object]]s with an explicit direction. This directionality breaks the symmetry of symbolic representation, which is the smallest amount of information in all contexts. | An [[ordered relation]], or a [[directed relation]] can be considered as the building block of [[Partially ordered set]]s<ref>{{:Paper/Outline of a Mathematical Theory of Computation}}</ref>. It can be visualized as an [[arrow]] that relates two [[object]]s with an explicit direction. This directionality breaks the symmetry of symbolic representation, which is the smallest amount of information in all contexts. | ||
<noinclude> | <noinclude> | ||
| Line 6: | Line 6: | ||
==Related Pages== | ==Related Pages== | ||
[[Category:Arrow]] | |||
[[Category:Order]] | [[Category:Order]] | ||
</noinclude> | </noinclude> | ||
Revision as of 14:10, 18 January 2022
An ordered relation, or a directed relation can be considered as the building block of Partially ordered sets[1]. It can be visualized as an arrow that relates two objects with an explicit direction. This directionality breaks the symmetry of symbolic representation, which is the smallest amount of information in all contexts.
References
- ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group.