| 11. | Viewing lattices as partially ordered sets, this says that the meet operation dual:
|
| 12. | A totally ordered set without infinite descending chains is called well-ordered.
|
| 13. | In the years 1906 1909 Hausdorff did his fundamental work on ordered sets.
|
| 14. | A sorted linear hash table may be used to provide deterministically ordered sets.
|
| 15. | Directed sets are a generalization of nonempty totally ordered sets.
|
| 16. | Unlike the latter, the product order of two totally ordered sets is not total.
|
| 17. | Suppose that " S " is a partially ordered set.
|
| 18. | The stencil is an ordered set of l relative coordinates.
|
| 19. | A given partially ordered set may have several different completions.
|
| 20. | A partially ordered set in which all pairs have a join is a join-semilattice.
|
