History of Order isomorphism

	Revision 4 . . August 11, 2001 8:48 pm by Zundark
	Revision 3 . . (edit) July 31, 2001 5:51 pm by Jan Hidders

---

Difference (from prior major revision) (no other diffs)

Changed: 1,2c1,2

Given two partially ordered sets (S, <=) and (T, [=) an order isomorphism from (S, <=) to (T, [=) is an isomorphism from S to T that preserves the order, that is, it is a bijection h : S -> T such that for all u and v in S it holds that : h(u) [= h(v) iff u <= v.

Given two partially ordered sets (S, <=) and (T, [=) an order isomorphism from (S, <=) to (T, [=) is an isomorphism from S to T that preserves the order, that is, it is a bijection h : S -> T such that for all u and v in S it holds that : h(u) [= h(v) if and only if u <= v.

Changed: 4c4

If there is an order isomorhpism between two partially ordered sets then these sets are called [order isomorphic]?.

If there is an order isomorphism between two partially ordered sets then these sets are called order isomorphic.