Discrete ordering relations

Discreteness is usually defined in terms of topology. In discrete mathematics, however, it was sometimes felt that other notions of discreteness should be at hand. We propose the notion of discreteness as a fixed point property of a relation. Using relational algebra, we prove formally that a strict discrete ordering possesses a (generalized) Hasse-diagram.