Line 4: Line 4:
  
 
<h2>
 
<h2>
Definition
+
Definitions
 
</h2>
 
</h2>
  
Line 10: Line 10:
 
<math>\langle A, R \rangle</math> is an ordered class iff
 
<math>\langle A, R \rangle</math> is an ordered class iff
 
<ol>
 
<ol>
 +
<li><math>R\subseteq A\times A</math></li>
 +
<li>(irreflexivity) <math>\forall x \in A \langle x,x \rangle \notin R</math></li>
 +
<li>(transitivity) <math>\forall x,y,z \in A \langle x,y \rangle \in R \wedge \langle y,z \rangle \in R \rightarrow \langle x,z \rangle \in R</math></li>
 +
<li>(trichotomy) <math>\forall x,y \in A \langle x,y \rangle \in R \wee \langle y,x \rangle \in R \wee x=y</math></li>
 
</ol>
 
</ol>
 
</p>
 
</p>

Revision as of 07:57, 1 June 2013

Equivalences of Well-ordered Relation

Definitions

$ \langle A, R \rangle $ is an ordered class iff

  1. $ R\subseteq A\times A $
  2. (irreflexivity) $ \forall x \in A \langle x,x \rangle \notin R $
  3. (transitivity) $ \forall x,y,z \in A \langle x,y \rangle \in R \wedge \langle y,z \rangle \in R \rightarrow \langle x,z \rangle \in R $
  4. (trichotomy) $ \forall x,y \in A \langle x,y \rangle \in R \wee \langle y,x \rangle \in R \wee x=y $

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood