claim
active
claim:down-sets-are-more-convenient-than-up-sets-for-many-purposes-in-order-theory

Down-sets are more convenient than up-sets for many purposes in order theory.

Observation that ↓ operator is easier to work with than ↑ due to order-preservation rather than order-reversal.

Source paper

extracted_from
Ordered Sets and Complete Lattices: A Primer for Computer Science
(2002) · Priestley, Hilary A.

Neighborhood — ranked by edge-count

Communities (2)

community

Concepts (1)

concept

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.