← ClaudeAtlas

ck-expandlisted

Apply the C→C operator - partition a concept node into child concepts, labelled restrictive or expansive. Use when a C-K session has an open node that needs children, when the user asks to explore or branch a concept, or clicks "partition" on the canvas.
dbbz/C-K-studio · ★ 0 · AI & Automation · score 67
Install: claude install-skill dbbz/C-K-studio
# C→C — partitioning a concept Read `${CLAUDE_PLUGIN_ROOT}/references/GRAMMAR.md` first. Partition type is judged relative to the **parent node's** object, not the root. ## The craft move: negate the constitutive properties Most people generate partitions by varying performance — faster, cheaper, lighter. That produces restrictive partitions forever. The reliable route to expansive ones is mechanical: **Step 1. Write down the received identity of the object at this node.** Not what it should do — what something must *be* to count as one of these at all. For "boat": - it floats by displacing water - it has a hull - the cargo travels inside it - it is a single object - it is propelled - it stays on the surface Aim for six to ten. The good ones feel too obvious to write down. Those are exactly the ones nobody has questioned. **Step 2. Negate each in turn.** Each negation is a candidate expansive partition: *a boat that doesn't float. A boat with no hull. A boat whose cargo travels outside it. A boat that is many objects. A boat that isn't propelled.* **Step 3. Run each candidate through the undecidability test.** Discard the ones K settles — those are knowledge, not concepts. What survives is your expansive set. **Step 4. Add restrictive partitions deliberately, not by default.** They're how a branch gets close enough to reality to conjoin. Just know which you're writing. This is the literature's own move, not a heuristic invented here — it is how the tested defixation