Mathematical Structures: History of Preordered sets

# History of Preordered sets

 Revision 5 . . July 10, 2004 3:55 pm by Jipsen Revision 4 . . July 10, 2004 3:53 pm by Jipsen Revision 3 . . July 10, 2004 10:48 am by Jipsen Revision 2 . . October 15, 2003 10:59 pm by 66.66.125.xxx

Difference (from prior major revision) (author diff)

Changed: 30c30,31
 \abbreviation{}
 \abbreviation{Qoset}

Changed: 32,34c33,34
 A preordered set (also called a quasi-ordered set or qoset for short) is a structure $\mathbf{P}=\left\langle P,\preceq \right\rangle$ such that $P$ is a set and $\preceq$ is a binary relation on $P$ that is
 A preordered set (also called a quasi-ordered set or qoset for short) is a structure $\mathbf{P}=\langle P,\preceq\rangle$ such that $P$ is a set and $\preceq$ is a binary relation on $P$ that is