Lab for Automated Reasoning and Analysis LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

preorder [2007/03/30 20:52]
vkuncak
preorder [2007/03/30 20:52] (current)
vkuncak
Line 2: Line 2:
  
 A (reflexive) preorder relation $\rho$ on set $A$ is a binary relation $r \subseteq A^2$ that is reflexive and transitive, that is, these two properties hold: A (reflexive) preorder relation $\rho$ on set $A$ is a binary relation $r \subseteq A^2$ that is reflexive and transitive, that is, these two properties hold:
 +
   * $x \mathop{\rho} x$   * $x \mathop{\rho} x$
-  * $x \mathop{\rho} y\ \land\ y \mathop{\rho} z \ \rightarrow\ x \mathop{\rho} z$ 
- 
  
 +  * $x \mathop{\rho} y\ \land\ y \mathop{\rho} z \ \rightarrow\ x \mathop{\rho} z$
  
 ===== Constructing a partial order from a preorder ===== ===== Constructing a partial order from a preorder =====
 
preorder.txt · Last modified: 2007/03/30 20:52 by vkuncak
 
© EPFL 2018 - Legal notice