Topics — What a work is about. Nucleation holds whatever reading the owner files here, whether or not an Anthology of the SOTA topic could also hold it; instruction for ML practice belongs to the anthology (ADR-048). The words are seeded from the clusters the reading-time triage of 2026-09-25 found, and grow by decision.
Compositionality — how the structure and meaning of a whole come from its parts and how they are combined — the principle of compositionality and compositional semantics, the emergence of compositional structure in languages under transmission, and composition and binding in learned models (generalization to unseen combinations, attribute binding, composing distributions or concepts). A work on making a model generalize compositionally is ML practice and goes to the anthology (ADR-031).
2 of 100 TERM documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| TERM-090 v2 | effective boundary constraint, of a composite: the relation its interconnected parts impose on the variables an outside system can reach, once the interior is eliminated; approximately instantaneous or history-dependent, and, independently, possibly of a kind the parts’ relations could not state | What CLAIM-480 demonstrates and CLAIM-474, QUESTION-283 and CASE-179 use. A composite presents the systems that interact with its boundary with a relation among its accessible variables. Its examples are the series spring’s k₁k₂/(k₁ + k₂), Baez and Fong’s black box, a memory kernel, and Hansen and Ghrist’s three-way v₁ = v₂ + v₃. The term fixes three points: the relation is a constraint whether instantaneous or history-dependent; it is effective, not a new fundamental law; and it can exceed the parts’ relational vocabulary. Adopted 2026-10-29. | Active |
| TERM-091 v2 | relational vocabulary, of a class of descriptions: the arities and kinds of relation it can state (pairwise or higher-order, among states or among histories, of which declared types), and so which constraints are expressible in it at all | What QUESTION-283 asks about: whether composition can force a description to adopt relations its parts never needed. A sheaf on a graph has a pairwise vocabulary. Eliminating an interior can leave a constraint outside it (THEORY-1090). A luria record’s relational vocabulary is its declared relation types and fields, and amendments that add one (ADR-043, ADR-044) enlarge it. The term lets the record say that a constraint is inexpressible in a vocabulary, which is different from saying that it is false or unknown. Adopted 2026-10-29. | Active |