Difference between revisions of "Ordered relation"
Jump to navigation
Jump to search
| Line 9: | Line 9: | ||
[[Category:Order]] | [[Category:Order]] | ||
[[Category:Relation]] | [[Category:Relation]] | ||
[[Category:Function]] | |||
</noinclude> | </noinclude> | ||
Revision as of 02:06, 19 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.