Difference between revisions of "Ordered relation"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
An [[ordered relation]], or a [[directed relation]] is the generic 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. The directionality of a [[directed relation]] breaks the symmetry of symbolic representation, which is the smallest amount of information, therefore, [[directed relation]]s can be used to represent any other kinds of information content. Ordered relations are particularly useful in representing [[causal relation]]s. | An [[ordered relation]], or a [[directed relation]] is the generic building block of [[Partially ordered set]]s<ref name=Outline>{{: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. The directionality of a [[directed relation]] breaks the symmetry of symbolic representation, which is the smallest amount of information, therefore, [[directed relation]]s can be used to represent any other kinds of information content<ref name=Outline>Section 2. Data Types and Mappings, Page 6, Axiom 1:A data type is a partially ordered set.</ref>. Ordered relations are particularly useful in representing [[causal relation]]s. | ||
=Prefix and Postfix Expressions= | =Prefix and Postfix Expressions= | ||
Revision as of 07:16, 3 July 2022
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 content[1]. 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
- ↑ 1.0 1.1 Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group.
Cite error: Invalid
<ref>tag; name "Outline" defined multiple times with different content
Related Pages