Operations on Partial Orders

09/27/2018
by   Karl Schlechta, et al.
0

We define analogues of Boolean operations on not necessarily complete partial orders, the height of an element as the maximal length of chains going from BOTTOM to that element, and use height to define probability measures.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset