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<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. | 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. Ordered relations are particularly useful in representing [[causal relation]]s. | ||
=Prefix and Postfix Expressions= | =Prefix and Postfix Expressions= | ||
Revision as of 03:40, 8 March 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. Ordered relations are particularly useful in representing causal relations.
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.