Difference between revisions of "Partially order"
Jump to navigation
Jump to search
imported>Benkoo |
|||
| (6 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
[[Partially | [[wikipedia:Partially ordered set|Partially ordered set]], or [[wikipedia:Partially ordered set|Poset]] is a mathematical construct that relates objects of interests in terms of a single kind of inclusive or containment relationship. In mathematics, the following notations are often used to define the ordering relations between <math>A</math> and <math>B</math>. | ||
<math>A \> B</math> | <math>A > B</math>, <math>A \subset B</math>, <math>A \sqsubset B</math>, <math>A \succ B</math> | ||
Similarly, for inclusive or equal to the two objects of interests, the mathematical expressions can be written this way: | |||
<math>A \geq B</math>, <math>A \subseteq B</math>, <math>A \sqsubseteq B</math>, <math>A \succeq B</math> | |||
Latest revision as of 04:21, 26 May 2021
Partially ordered set, or Poset is a mathematical construct that relates objects of interests in terms of a single kind of inclusive or containment relationship. In mathematics, the following notations are often used to define the ordering relations between and .
, , ,
Similarly, for inclusive or equal to the two objects of interests, the mathematical expressions can be written this way:
, , ,
