Difference between revisions of "Partially order"

From PKC
Jump to navigation Jump to search
Line 1: Line 1:
[[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>.
[[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 \subset B</math>,  <math>A \sqsubset B</math>, <math>A \succ B</math>
  <math>A > B</math>, <math>A \subset B</math>,  <math>A \sqsubset B</math>, <math>A \succ B</math>

Revision as of 04:05, 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:

, , ,