Difference between revisions of "Partially order"

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 $A$ and $B$ .

 $A>B$ ,  $A\subset B$ ,   $A\sqsubset B$ ,  $A\succ B$

Similarly, for inclusive or equal to the two objects of interests, the mathematical expressions can be written this way:

 $A\geq B$ ,  $A\subseteq B$ ,  $A\sqsubseteq B$ ,  $A\succeq B$

Revision as of 04:05, 26 May 2021 (view source) Benkoo (talk \| contribs) ← Older edit		Latest revision as of 04:21, 26 May 2021 (view source) imported>Benkoo
(2 intermediate revisions by one other user not shown)
Line 1:		Line 1:
	[[wikipedia:Partially ordered set\|Partially ordered set]], or [[wikipedia:Partially ordered set\|~~PO Set~~]] 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>

Difference between revisions of "Partially order"

Latest revision as of 04:21, 26 May 2021

Navigation menu

Search