| 41. | By using these constructions, one can use topological ordering algorithms to find linear extensions of partial orders.
|
| 42. | The covering relation is commonly used to graphically express the partial order by means of the Hasse diagram.
|
| 43. | The result is a partial order.
|
| 44. | This partial order is analoguous to the natural order on the real numbers, but only to some extent.
|
| 45. | The orthogonal complement is thus a Galois connection on the partial order of subspaces of a Hilbert space.
|
| 46. | This connection to bipartite matching allows the width of any partial order to be computed in polynomial time.
|
| 47. | It is a strict partial order; every strict partial order can be the result of such a construction.
|
| 48. | It is a strict partial order; every strict partial order can be the result of such a construction.
|
| 49. | \preceq is a partial order.
|
| 50. | This partial order has the physical meaning of the causality relations between relative past and future distinguishing spacetime events.
|
