concept
active
concept:partial-order-of-stepsPartial Order of Steps
Mathematical representation of precedence relations among steps: which centers must be in position before another can be formed, defining good sequences as linearizations that minimize backtracking.
Neighborhood — ranked by edge-count
Claims (1)
claim
- A combinatorial argument that good sequences are astronomically rare, emphasizing the difficulty of discovery.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- The house/garden example demonstrates that a poor sequence can violate positive space, while the reversed sequence yields wholesome results.
- Foundational hypothesis of Domain Theory: partial order structure (D, ⊑) captures information ordering without quantification.
- Practitioner's question about sequence in a living process.
- Fundamental structure: a set with a reflexive, antisymmetric, transitive relation.
- The idea that living structure emerges only through a sequence of small, structure-preserving moves, not by a single grand blueprint.
- Design approach emphasizing breaking wholes into parts while preserving relationships, praised by a designer as Alexander's 'gold'.
- Segments of reasoning separated by \n\n tokens used as the unit of analysis in ReflCtrl