Sets, Order & Foundational Structure

Primes about the basic building blocks of formal structure: set-theoretic notions like cardinality, complementarity, partition, and the empty set, alongside ordering and organizing relations — equivalence relations, hierarchy, order, connectedness, and well-foundedness.

19 primes in this family — primes that sit near one another in abstraction space (k-means over structural-signature embeddings). Each is shown with its short description.

• Cardinality — Size of sets.
• Co-location — Distinct entities or functions occupy the same bounded place during an overlapping interval, reducing separation while leaving their interaction and purpose unspecified.
• Complementarity — Two non-overlapping roles that jointly exhaust a whole and require each other.
• Connectedness — A whole that cannot be split into parts with no relation crossing between them.
• Empty Set — Absence made into a fully-typed, first-class object rather than an error.
• Equivalence Relation — Groups elements into equivalence classes.
• Finiteness — Bound a collection, process, horizon, description, or resource so its members or steps can in principle be exhausted, completing enumeration rather than opening an unending remainder.
• Hierarchy — Organizes elements into levels or ranks.
• Identity Element — A distinguished input leaves every compatible element unchanged under a stated operation, supplying the do-nothing case that makes empty composition possible.
• Indexed family — Organize a collection by assigning one object to every element of a declared index set, allowing repetition and preserving the identity of positions.
• Infinity — Unbounded quantity.
• Monoid — Equip a set with one closed associative binary operation and a two-sided identity, creating the exact algebraic tier whose neutral element makes empty products and folds well-defined while still withholding inverses.
• Order — Defines ranking or sequencing relationships.
• Partition — A division of a set into non-overlapping, collectively exhaustive blocks.
• Pigeonhole principle — Whenever more items are assigned to fewer available categories or slots, at least one slot must receive multiple items.
• Power set — For a set S, form the set whose members are exactly all subsets of S, including the empty set and S itself.
• Semigroup — The minimal algebraic species — a set with one closed, associative binary operation and nothing more — whose lone axiom certifies that any finite product is parenthesization-independent, so a sequential reduction can be split, reassociated, and run in parallel without changing the answer.
• Transitive relation — Whenever a relation carries from a first element to a second and from that second to a third, it also carries directly from the first to the third.
• Well-Foundedness (Well-Ordering) — Prevents infinite descent.