A bottleneck presupposes dependency because the slowest-element-governs-the-whole pattern only obtains in a chain of dependent operations.

A bottleneck presupposes dependency because the binding-local-constraint-governs-global-rate signature only obtains where operations are linked by directed reliance into chains or networks. Without dependency's structure — one stage cannot proceed unless its upstream input is supplied — there is no chain whose throughput could be capped by its slowest link, and improving non-bottleneck elements would not be wasted. Dependency supplies the coupling that makes throughput a system property rather than a sum of independent rates; the bottleneck is then the specific node where that coupling becomes the binding constraint.


A bottleneck is the specific shape a constraint takes when one stage's limited capacity binds the throughput of an entire pipeline.

A bottleneck is the specific shape constraint takes in a chained-throughput system: the binding restriction is localized to a single stage whose capacity caps the aggregate rate, so improvements anywhere else fall outside the feasible-gain set. Where constraint names any binding restriction on admissible configurations, bottleneck particularizes it to serial or networked production, where the slowest element defines the feasible throughput envelope. Relieving non-bottleneck elements is structurally non-binding; only the bottleneck moves the global rate, making it the operative constraint.


Bottleneck is typically a specialization of Cut, retaining the parent's defining structure while adding the child's specific commitments.

Cut supplies the genus: A partition of a network's vertices and the crossing edges, converting global connectivity into a local edge-set. Bottleneck preserves that general structure while adding its differentia: The single limiting stage that caps an entire system's throughput. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Bottom-up perspectives is typically the specific shape emergence takes when distributed local contributions aggregate into a higher-level account without central design.

Emergence is the appearance, at a higher level of organization, of properties not attributable to lower-level constituents and not trivially predictable from them. Bottom-up perspectives is typically the specific shape this pattern takes in analytical and governance practice: many distributed local inputs aggregate into a higher-level system, product, or policy that is itself an emergent artifact rather than a pre-specified design. It is a structurally-particularized instance of emergence whose specific machinery is aggregation of local contributions, though some bottom-up practices are coordinated rather than emergent, hence typical.


Boundary critique is the specific shape reflexivity takes when an analysis turns back on its own implicit choice of system boundary.

Reflexivity is the pattern in which a system's observations or models about itself become inputs that shape its own behavior, producing a self-referential loop between description and described. Boundary critique is the particular shape this move takes for systems analysis: every analysis depends on an implicit choice of what is inside the system, and the analysis must turn back on that choice, surfacing and questioning the boundary judgment as part of the work. A structurally-particularized instance of reflexivity in which the self-reference is the analyst's framing choice being made an object of the analysis itself.


Boundary critique presupposes boundary because the reflective questioning of inside-versus-outside choices requires a prior boundary to be drawn and made explicit.

Boundary critique is the reflective practice of surfacing and questioning the implicit choice of what counts as inside versus outside a system analysis, which structurally requires that a boundary is already operative or proposed. Without the boundary prime's substrate — a demarcation between an entity and what is outside it, with attendant flows, membership, and accountability — there would be nothing for the critique to inspect, no normative or strategic stakes in where the line is drawn, and no alternative boundaries to consider.


A Boundary Disclosure Card typically presupposes the producer-consumer reuse interface at which its standardized facts must be encountered.

The card is attached at an artifact's reuse boundary so that a downstream consumer encounters the disclosure at the decision point. Interface supplies that producer-consumer crossing, while the card is the disclosure surface attached there rather than the operative contract governing interaction.


A Boundary Disclosure Card contains Provenance when its schema includes origin or lineage among the facts attached to the reusable artifact.

When origin matters for safe reuse, the card carries a provenance slot alongside contents, limits, hazards, expiry, or dependencies. The live identity requires a small selected fact set but does not require provenance specifically; a valid nutrition, capability, or hazard card can omit origin.


Boundary signal spillover is leakage specialized to a signal escaping its intended audience boundary through a permeable carrier.

It inherits unintended passage beyond a containment scope and adds an adjacent audience, its independent receiver-side calculus, and overflow of an apparatus sized only for the target audience.


Boundary state loss requires a carrier boundary across which a bounded artifact must convey state.

The loss event is defined at a transition between carriers or contexts; remove the boundary and there is no handoff at which encoding capacity can discard state, although the boundary is the site rather than the loss itself.


Bounded rationality presupposes decision because it describes how real decision-makers operate under cognitive and informational constraints.

Bounded rationality is the structural claim that real decision-makers operate under binding limits on information, capacity, and time that shape their choice processes. The claim only has content where a decision is being made — an agent selecting among alternatives under constraint. Decision supplies the act of selecting one alternative from a set, committing future resources, and closing off other paths; bounded rationality presupposes that selection event as its subject matter, then specifies that real agents do not perform it as unconstrained optimizers but as satisficers searching local neighborhoods.


Bounded rationality is the specific shape constraint takes when the binding restrictions act on cognitive, informational, and time resources of decision-makers.

Constraint is a condition that restricts admissible configurations or choices to those satisfying it, with the feasible set as a first-class object of analysis. Bounded rationality is the particular shape this pattern takes when the restrictions act not on physical configurations but on the cognitive, informational, and computational resources available to a decision-maker. The agent's choice process is bounded by binding limits on these resources, producing local search and aspiration-based stopping. A structurally-particularized instance of constraint whose specific binding dimensions are cognition, information, and time.


Bracketing typically presupposes Framing, whose structure must already obtain for the child mechanism to be meaningful or operational.

Framing supplies the prerequisite condition: Presentation shapes perception. Bracketing operates against that background: Deliberately suspending a held frame from operative use within a scoped inquiry. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Braess's paradox is about the GAP between the selfish equilibrium and the social optimum, and how added capacity widens it — a property of equilibrium SELECTION over load-sensitive edges. Presupposes equilibrium (it is not equilibrium itself but a phenomenon of its selection).


Branch and bound is the specific shape decomposition takes for combinatorial optimization, partitioning the solution space into prunable subsets.

Branch and bound is the specific shape decomposition takes when applied to combinatorial optimization. The general decomposition pattern breaks a whole into constituent parts such that the parts, properly combined, reconstitute the whole and enable independent analysis. Branch and bound instantiates this by recursively partitioning the solution space into subsets (branches), computing bounds on each subset's optimal value, and pruning subsets whose bound proves they cannot contain the optimum. The decomposition is into mutually exclusive subsets that together cover the original space, with bounding supplying the structural reason that allows whole regions to be dismissed without exploration.


Branch and bound is a specialization of optimization that implicitly enumerates the feasible set by recursive partitioning and bound-driven pruning.

Branch and bound is a specialization of optimization in which the search apparatus is implicit enumeration: the feasible set is recursively partitioned (branching), upper and lower bounds on the optimal objective within each subset are computed (bounding), and subsets provably unable to contain the optimum are pruned. It inherits the general optimization commitment of finding the best element of a specified set under stated constraints with respect to a stated objective, and specializes by giving that search the divide-and-conquer-plus-pruning shape that drives modern integer and mixed-integer programming solvers.


'Branch-and-bound is backtracking PLUS bounding' — the same commit-check-rollback skeleton augmented with an optimisation bound. backtracking is the base/genus, branch_and_bound the optimisation child. Add backtracking as parent (additive; branch_and_bound keeps optimization;decomposition). Backtracking supplies the genus: Extend a partial solution one step at a time and reverse the most recent commitment as soon as a constraint proves it cannot succeed, preserving earlier work. Branch and Bound preserves that general structure while adding its differentia: Systematic search with pruning. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


Branching and merging presupposes versioning because forks and merges only make sense when distinct artifact states are identified, retained, and diffable.

Branching and merging requires that distinct states of an artifact be separately identifiable, retrievable, and comparable, because a fork creates a divergent parallel state that must coexist with the trunk and a merge must reconcile two prior states into one. Without versioning's stable identifiers, retained history, and computable differences between states, there is no substrate on which divergence and reconvergence operate — the fork would have nothing to address and the merge would have no priors to reconcile.


Branching and merging presupposes state and state transition because forks and merges are operations that take prior states to new states.

Branching and merging operates on a substrate of identifiable system states and rule-governed transitions between them: a fork is a transition that produces two child states from a parent, and a merge is a transition that reconciles two parent states into one child. The pattern cannot exist without the underlying commitment that the system has a state space and a transition relation; the fork-and-merge operations are themselves a specific structure imposed on that more general state-transition machinery.


Brandolini's law is asymmetric attack-defense cost specialized to cheap corruptive claims and evidence-heavy correction on a shared information channel.

Brandolini retains the parent's non-discriminating channel, harmful and corrective flows, per-unit production-cost ratio, bounded defense capacity, saturation threshold, and need to redesign the ratio or channel. It fixes the attack to false or low-quality claims, the defense to fact-checking and contextual reconstruction, and adds an audience-overlap gap.


Bricolage presupposes a fixed, heterogeneous inventory whose insufficiency rules out acquiring purpose-built inputs.

Recombining what is already at hand is the defining response to constrained availability; if arbitrary new materials can be obtained, the fixed-inventory structure that distinguishes bricolage disappears.


Brinkmanship is 'a specific and unusual case' of commitment_device — the constraint is a probability-ramping process toward a SHARED catastrophe, making a STOCHASTIC catastrophe credible by ceding control (vs a generic device locking in a certain action). Commitment Device supplies the genus: A self-imposed constraint that binds one's own future choices. Brinkmanship preserves that general structure while adding its differentia: Deliberately raising a stochastic risk of shared catastrophe, using the rising probability as a bargaining lever. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


Brinkmanship is a specialization of Coercion, retaining the parent's defining structure while adding the child's specific commitments.

Coercion supplies the genus: Shaping another agent's choice by manipulating the costs and threats attached to their options, so the agent itself 'chooses' the coercer's preferred action — the common parent of forcing an action (compellence) and forcing restraint (deterrence). Brinkmanship preserves that general structure while adding its differentia: Deliberately raising a stochastic risk of shared catastrophe, using the rising probability as a bargaining lever. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


Broken windows is a positive-feedback signal-inference-response loop with a density threshold (same algebra as an epidemic R0-crossing) — a specialization of feedback restricted to agents inferring a hidden enforcement-cost regime from observable disorder residue. Feedback supplies the genus: Outputs influence inputs. Broken Windows Theory preserves that general structure while adding its differentia: Visible unrepaired disorder signals weakened enforcement, lowering the perceived cost of further violation in a self-reinforcing cascade. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Buffering presupposes reserve because the absorbing capacity that buffering uses to smooth variation is precisely a maintained surplus.

Buffering presupposes reserve because the capacity it deploys — to absorb perturbation between source and consumer, smoothing variation and decoupling rate mismatches — is precisely a maintained surplus held beyond immediate need. Without reserve's prior structure of deliberately uncommitted capacity available for use when demand spikes or supply dips, buffering would have nothing to draw on. Buffering inherits the reserve framework and supplies a specific deployment pattern: the surplus is positioned between two coupled stages so that excess input fills the reserve and deficit demand drains it, transforming variable flow into steadier output.


Buffering is the framed or domain-specific realization of Decoupling Point; removing the local frame leaves the parent's structural relation intact.

After the chemistry_materials frame is stripped away, the retained structural roles are those of Decoupling Point: The buffered interface where a flow splits from forecast-driven push upstream into order-driven pull downstream, and whose position sets the lead-time, inventory, and customisation trade-offs. Buffering adds the local frame and commitments expressed in its identity: A maintained intermediate capacity that absorbs excess and releases it during shortfall, smoothing variation and decoupling a source from a consumer whose rates do not match. The parent pattern remains recognizable without that vocabulary, while the child is the framed realization of it. That preservation test establishes decomposition rather than taxonomic subsumption.


The bulkhead pattern is partition specialized by sibling isolation and local-failure containment.

A bulkhead divides a shared critical resource into non-overlapping sibling compartments, adding bounded cross-coupling and the differentia that exhaustion or failure in one block must not drain the others.


Bycatch is what a false-positive RATE becomes when it acts on the world — the real-world non-target capture, with a magnitude-asymmetry and ledger-invisibility dimension the bare error taxonomy lacks. Built on the Type-I/false-positive category; presupposes it. 'Bycatch is the impact-and-visibility structure built on top of the bare error category.'. Type I & Type II Errors supplies the prerequisite condition: False positive/negative. Bycatch operates against that background: A selective process aimed at one target class also captures non-target classes because of the selector's finite specificity, and the harm persists because the success metric counts only the target. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


A bypassed safeguard presupposes a protective control (a constraint installed to prevent a hazard) that operators route around under production pressure; it is a failure mode OF a constraint, built on the safeguard it disables. Constraint supplies the prerequisite condition: Limits possibilities to guide outcomes. Bypassed Safeguard operates against that background: A protective control is systematically routed around by the very operators it was meant to protect, because it imposes friction against a production task and the workaround is locally rewarded and globally invisible until the rare hazard arrives. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Bypassed Safeguard is a specialization of Benign-Sampling Safety Drift, retaining the parent's defining structure while adding the child's specific commitments.

Benign-Sampling Safety Drift supplies the genus: A system near a hazard boundary reads a benign sample of outcomes — uneventful only because the hazard is rare, not because the margin is safe — as proof the safety margin is unnecessary, so each lucky round licenses the next erosion until a low-probability event finds the now-absent buffer. Bypassed Safeguard preserves that general structure while adding its differentia: A protective control is systematically routed around by the very operators it was meant to protect, because it imposes friction against a production task and the workaround is locally rewarded and globally invisible until the rare hazard arrives. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


The bystander effect presupposes responsibility diffusion because the decline in any individual's likelihood of acting is driven by responsibility spreading across the group.

The bystander effect is the pattern in which each potential intervenor's probability of acting decreases as the number of co-present others rises. Responsibility diffusion — the structural paradox by which spreading obligation across multiple agents reduces each agent's felt personal accountability — is the mechanism producing that decrease. Without responsibility diffusing across the pool, additional bystanders would not weaken any individual's motivation to act. The bystander effect is therefore the emergency-intervention manifestation of the diffusion pattern, presupposing it as the engine of declining per-agent action probability.


The bystander effect is the specific shape coordination problems take when multiple potential helpers must align on who acts but lack a focal mechanism.

Coordination problems arise when multiple stable equilibria exist and agents must align on one without the decision structure uniquely selecting an answer. The bystander effect is the particular shape this pattern takes in emergency intervention: many co-present potential helpers each face the equilibrium-selection question of who should act, with no built-in mechanism designating one. Diffused responsibility, pluralistic ignorance, and evaluation apprehension prevent any equilibrium from being uniquely selected, often producing the no-one-acts outcome. A structurally-particularized instance of equilibrium-selection failure in a multi-agent helping context.


Caching presupposes Optimization: keeping a fast local copy minimizes expected access cost under locality and capacity constraints.

Caching maintains a small, fast tier holding likely-to-be-reused items so that average access latency or bandwidth cost is minimized given finite cache capacity. The eviction policy, sizing, and placement decisions are all instances of choosing values to minimize an expected-cost objective subject to capacity constraints. That is the optimization triplet — variables, objective, constraints — and caching presupposes optimization because every nontrivial cache design is implicitly or explicitly the solution to such a problem.


Caching presupposes locality of reference because exploiting a fast-local copy only pays off when accesses cluster temporally or spatially.

Caching presupposes locality of reference because the economic case for maintaining a small fast tier alongside a large slow tier depends entirely on workloads in which accesses cluster: recently-used items are likely to be reused soon, and items near a used one are likely to be touched next. Locality supplies the empirical distribution-of-access regularity that makes a cache pay off; without it, every access is equally likely to miss and the cache provides no average-case advantage over going straight to the source.


Caching presupposes reserve because the fast local copy is a deliberately maintained surplus held against repeated access demand.

Caching maintains a fast, local copy of information whose original is slow to fetch, so repeated accesses are served from the copy rather than the source. The cache is meaningful only as a deliberately held surplus — extra storage allocated beyond strict need, valuable precisely because available when demand patterns reuse it. Reserve supplies that structural object: a maintained surplus beyond expected need, absorbing variation without failure. Caching specializes reserve to information access, with locality of reference as the demand pattern the surplus exploits and latency reduction as the value delivered.


Cadence presupposes and builds on periodic recurrence, adding rate-tunability framing on top. Periodicity supplies the prerequisite condition: Regular cycles. Cadence operates against that background: The recurring beat or rate at which repeated operations or periods are spaced — the tempo that sets how often, not the unit it spaces or the bare fact of repeating. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption.


Caldera collapse presupposes a load-bearing structure that depends on a support medium whose withdrawal supplies the failure mode.

The overburden remains intact and its load unchanged; failure occurs because a reliance condition is progressively removed until the unsupported structure drops into the void.


A frozen calibrated rule losing performance as its world drifts is a specific environmental-mismatch mode of temporal decay.

The child fixes the decaying capability to performance of a mapping and locates the cause in a widening calibration-to-current-world gap. The parent admits that case while also covering intrinsic material, informational, and organizational degradation.


Calibration secures one of the seven links (unit/traceability). A component of measurement. After the statistics_experimental_design frame is stripped away, the retained structural roles are those of Measurement: Mapping a target's attribute onto a scale via an instrument and procedure, yielding a value-plus-uncertainty tied to a unit and frame. Calibration adds the local frame and commitments expressed in its identity: Aligning a system's output to a trusted reference by measuring deviation, adjusting to reduce it, and monitoring for drift. The parent pattern remains recognizable without that vocabulary, while the child is the framed realization of it. That preservation test establishes decomposition rather than taxonomic subsumption.


Calibration is typically a specialization of Discrepancy-Driven Correction, retaining the parent's defining structure while adding the child's specific commitments.

Discrepancy-Driven Correction supplies the genus: Iteratively close the signed gap between a target and an observation. Calibration preserves that general structure while adding its differentia: Aligning a system's output to a trusted reference by measuring deviation, adjusting to reduce it, and monitoring for drift. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Names calibration as one of the prime's slots — the standing loop that keeps production/combination rules honest against outcomes. A component of a working annotation. After the statistics_experimental_design frame is stripped away, the retained structural roles are those of Confidence Annotation: A graded warrant marker attached to a claim that travels with it and tells downstream consumers how much weight to place on it. Calibration adds the local frame and commitments expressed in its identity: Aligning a system's output to a trusted reference by measuring deviation, adjusting to reduce it, and monitoring for drift. The parent pattern remains recognizable without that vocabulary, while the child is the framed realization of it. That preservation test establishes decomposition rather than taxonomic subsumption.


A callback is 'a narrow, mechanical special case of authority transfer: one action, one condition, no judgment' — registration transfers authority to the holder to act in the registrant's name. A specialization of delegation_of_authority (which grants broad ongoing discretion). Delegation of Authority supplies the genus: Assign responsibility. Callback preserves that general structure while adding its differentia: A named action handed off in advance, to be invoked later by someone else when a specified condition arises, releasing the registrant from synchronous waiting. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Canonical form PRESUPPOSES an equivalence relation (the partition) and adds a deterministic reduction to a unique per-class representative plus the biconditional (equivalent iff identical canonical forms). The relation alone does not supply the representative or the cheap-equality economy.


Capability Separation presupposes an Authentication procedure that checks whether an artifact genuinely originates from the privileged issuer.

Capability Separation allocates issuance and verification powers across roles and maintains a forgery barrier. Authentication supplies the procedure that binds the artifact's asserted origin to admissible evidence and returns the verdict on which open verification relies. The architecture is not a kind of that procedure; it presupposes the procedure while adding the asymmetric allocation of capabilities and the invariant that verification must not confer issuance.


A Capacity-Recovery Interval contains the trade of present output or momentum for greater future capacity and lower collapse risk.

Remove the enforced exchange between present output and future restored capacity and there is no reason to enter the interval: the system could continue producing while recovering fully. The bounded low-load state is constituted by accepting a current sacrifice to buy a different future feasible set.


A Capacity-Recovery Interval presupposes a negative-yield threshold because its timing is defined by beginning before continued loading makes later restoration materially harder or impossible.

The interval must start while continuation remains possible but before additional loading flips from productive to net harmful. Remove that threshold and the entry condition loses its defining criterion, leaving generic inactivity or scheduling rather than a prophylactic capacity-recovery interval.


Equal Cardinality is defined by the existence of a Bijection, allowing finite and infinite collections to be compared without enumerating them.

Bijectivity supplies the no-collisions, no-gaps correspondence. Cardinality turns existence of such correspondences into equinumerosity classes, orders them by injections, and develops cardinal arithmetic and transfinite hierarchy.


Cardinality contains the equinumerosity Equivalence Relation whose classes are the cardinal numbers.

Bijections make same-cardinality reflexive, symmetric, and transitive, so sets partition into equinumerosity classes. Cardinality adds ordering, arithmetic, finite counting, and the transfinite hierarchy over those classes.


Cardinality requires sets as the collections whose size is compared while deliberately ignoring the identity of their elements.

Set and Membership supplies distinct elements and collections as first-class objects. Cardinality adds equinumerosity, cardinal numbers, comparison by injection, and the finite and transfinite size hierarchy.


Carrying Capacity contains the sustainable-load Threshold separating normal operation from nonlinear saturation and substrate-eroding overshoot.

Its three-zone curve is organized around a configuration-set critical load. Threshold supplies that boundary value; carrying capacity adds the load-bearing substrate, degradation beyond the boundary, shrinking future capacity, and recovery hysteresis. This repairs a previously standalone prime without coercing it into a false kind-of relation.


Every Cartesian Product strictly presupposes input sets, their elements, and membership before it can form all ordered cross-set tuples.

Cartesian Product is a derived construction over two or more sets. It requires a value set for each named dimension and membership tests that determine the admissible coordinate values, then forms every ordered tuple across them. The construction is not itself the primitive collection-and-belonging relation, so composition preserves the live entry's explicit boundary.


Cascade presupposes Network: sequential propagation requires a connection pattern through which state changes can travel from element to element.

A cascade is the propagation of a state change from one element to coupled neighbors, which then trigger theirs, until exhaustion or damping stops the chain. The propagation can occur only over a set of pairwise connections that carries the disturbance — a Network. Without a connection pattern there is no path along which the chain advances, so cascade presupposes network as the structural substrate over which sequential transmission runs and whose topology shapes the cascade's reach and shape.


A cascade is a specialization of propagation in which each affected element becomes a new source, producing self-perpetuating sequential transmission through coupling.

A cascade specializes propagation by requiring that each newly-affected element not merely register the disturbance but itself become a new source of it, re-emitting the perturbation to its neighbors. Where propagation names the systematic spreading of a signal or effect through a medium or network generally, a cascade fixes the transmission mode as sequential and self-perpetuating: every flipped element adds to the active source population, producing nonlinear total impact disproportionate to the trigger — a particular shape propagation takes when each receiver becomes a transmitter.


Cascade presupposes contagion because sequential transmission through coupled elements is the structural mechanism of contagious spread.

A cascade is the structural pattern in which a state change in one element triggers the same change in coupled neighbors, who then transmit to theirs, producing self-perpetuating chain propagation. The dynamic requires contact-mediated, self-reproducing transmission across a network — exactly what contagion names. Contagion supplies the underlying commitment: a state spreads from affected to connected elements through direct transmission, with each new host capable of infecting its own neighbors. Cascade specializes contagion to threshold-triggered, often-amplifying chain propagation, with disproportion-to-trigger as the characteristic signature.


The cascade is the propagation mechanism INSIDE a burst (one change triggering correlated others); punctuated_equilibrium embeds it within the longer stasis-load-reset cycle. 'the cascade is the burst's internals, not the whole tempo.'. After the systems_cybernetics frame is stripped away, the retained structural roles are those of Punctuated Equilibrium: Change runs bimodal in tempo: long intervals of near-stasis that load latent constraint, interrupted by short bursts of correlated structural reorganization. Cascade adds the local frame and commitments expressed in its identity: A change in one element triggers a chain of further changes. The parent pattern remains recognizable without that vocabulary, while the child is the framed realization of it. That preservation test establishes decomposition rather than taxonomic subsumption.


Catalysis is a strict leverage-point species: a small, reusable facilitator produces disproportionate transformation by lowering one pathway's barrier over many turnovers.

Every Catalysis instance satisfies the Leverage Points signature used by these entries: a comparatively small intervention at a sensitive pathway changes the transformation rate or product distribution disproportionately. Catalysis adds a permitted-but-slow transformation, a barrier-lowering facilitator, pathway selectivity, non-consumption, repeated turnover, and thermodynamic neutrality. Not every leverage point is catalytic, but that is the expected asymmetry between a genus and its strict species, not an exception requiring a typical qualifier.


A Category strictly contains Associativity as the law making every finite chain of arrows independent of how its binary compositions are grouped.

Category supplies objects, typed arrows, closure, identities, and the substance-blind stance. Associativity is the internal axiom equating the two parenthesizations of every three-arrow chain and licensing unambiguous paths.


A Category strictly contains closure of its morphisms under the partially defined operation that composes every endpoint-compatible pair.

The category adds objects, source and target typing, identity arrows, the associativity law, and the substance-blind modeling posture. Closure remains the internal guarantee that composing two admissible arrows produces another arrow of the same category, so paths can continue without escaping it.


Category Retrieval Lock In is a specialization of Lock-In, retaining the parent's defining structure while adding the child's specific commitments.

'the generic prime it specializes' — genus-to-species. category_retrieval_lock_in is lock_in where the costly-to-reverse commitment is a category label compiled into retrieval infrastructure, adding the retrieval-vs-substrate-lock split. Lock-In supplies the genus: Forward-looking cost of switching exceeds the forward-looking cost of staying, even when a superior alternative exists. Category Retrieval Lock In preserves that general structure while adding its differentia: A category label that made routine retrieval cheap obstructs novel re-use, because the retrieval infrastructure has compiled the label in place of the property list. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


A specific PATHOLOGY of search_and_retrieval — the compression that makes routine retrieval cheap is what obstructs novel retrieval. It presupposes a retrieval/indexing infrastructure. Search and Retrieval supplies the prerequisite condition: Locate and extract information. Category Retrieval Lock In operates against that background: A category label that made routine retrieval cheap obstructs novel re-use, because the retrieval infrastructure has compiled the label in place of the property list. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Causal Layered Analysis is foresight specialized to diagnosing and reconstructing possible futures across litany, systemic cause, worldview, and myth/metaphor.

It inherits disciplined plural-future inquiry undertaken to change present perception and action. It adds a fixed depth traversal from surface report through systems and worldview to myth, followed by upward reconstruction of alternative futures.


CLA contains a depth-ordered four-layer explanatory structure with an inverse visibility-leverage gradient and bidirectional traversal.

Remove the ordered litany, social-cause, worldview, and myth/metaphor strata and CLA loses both its diagnostic descent and reconstructive ascent. Layering is an internal organization of the method rather than its taxonomic genus.


Causality is a specialization of dependency in which one event productively brings about another with counterfactual modal robustness.

Causality is a specialization of dependency. The general dependency pattern is the directed asymmetric relation in which one element cannot proceed, function, or be interpreted unless a condition on another is met. Causality specializes by adding two commitments: a productive mechanism linking cause to effect (not merely correlation or precedence) and counterfactual modal robustness (had the cause not occurred, the effect would have differed). The same directed-asymmetric-reliance logic of dependency applies, with productive connection and counterfactual support as the specific gates distinguishing causation from looser dependence.


A center of gravity is the strict adversarial leverage-point species: disrupting its cohesion-bearing, substitution-resistant node disproportionately changes the contest.

Every Center of Gravity is a high-leverage intervention site by its defining test: disruption of the identified node causes a disproportionate system-wide change rather than an effect proportional to the node's size. It adds an adversarial contest, a cohesion-bearing and substitution-resistant node, paired attacker and defender analysis, and migration of the locus under hardening. Leverage Points also includes non-adversarial rules, goals, and parameters, so the relation is one-way strict specialization.


The CLT is a specific claim about the limiting SHAPE a SUM-aggregation converges to under finite variance — the Gaussian attractor. Presupposes aggregation (the bare combining operation); other rules (max, product) flow to other attractors.


Certification = a verification procedure PACKAGED into a portable, third-party-attested token; it presupposes (is built on) the verification work it wraps. Verification supplies the prerequisite condition: Check that an object conforms to its specification via a defined procedure yielding evidence and a verdict. Certification operates against that background: A trusted third party attests, after a defined evaluation, that an entity meets a standard, and issues a portable token downstream parties use as a substitute for re-doing the evaluation. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption.


Certification is an engineered mechanism for manufacturing transferable trust at a distance; it presupposes trust as the disposition it warrants. Trust supplies the prerequisite condition: Willingly accepting vulnerability to another party's future behavior under incomplete monitoring, based on positive expectations about their competence and intentions. Certification operates against that background: A trusted third party attests, after a defined evaluation, that an entity meets a standard, and issues a portable token downstream parties use as a substitute for re-doing the evaluation. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


The token's meaning is backed by the certifier's staked reputation; reputation is a load-bearing component. Reputation supplies the prerequisite condition: An aggregated signal of past behaviour that shapes how others treat an agent. Certification operates against that background: A trusted third party attests, after a defined evaluation, that an entity meets a standard, and issues a portable token downstream parties use as a substitute for re-doing the evaluation. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Ceteris paribus analysis requires reasoning about how a foreground change would differ while specified background conditions are held fixed. Counterfactual Reasoning supplies the prerequisite condition: Hypothetical alternatives. Ceteris Paribus operates against that background: Analyzing a foreground subsystem while explicitly holding the rest of the system fixed, tracking the gap. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption.


Prediction is the broad genus, change_notification the narrow structured species — a directed-broadcast subset where a party with privileged knowledge of a DECIDED change warns exactly those affected, early enough to act. A specialization adding directed-audience and lead-time and deliberate-change constraints. Foreseeing (Prediction) supplies the genus: Predict future states. Change Notification preserves that general structure while adding its differentia: Advance warning, directed at those who depend on a system, that it is about to change in a way they need lead time to prepare for. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Checks and Balances presupposes Constraint: each authority is bound by reciprocal restrictions that exclude unilateral action.

Checks and balances gives each holder of power explicit tools — veto, review, audit, override — that restrict the others' admissible actions to those consistent with mutual restraint. The reciprocal tools function as binding restrictions on the feasible set of unilateral moves, ruling out configurations regardless of other merit. That is the defining structure of a Constraint, here woven into a mesh of mutual restrictions. Checks and balances presupposes constraint as the operative mechanism by which power is bound.


Checks and Balances presupposes Feedback: each branch's checks become inputs to the others' subsequent decisions and behavior.

Checks and balances arranges authorities so that one branch's actions feed back to other branches as inputs that constrain their next moves: a veto, audit finding, or override returns to alter what the affected actor does next. That return path is exactly Feedback — output routed back to influence subsequent input — and it is what makes the reciprocal restraint dynamic rather than purely structural. Checks and balances presupposes feedback as the channel through which mutual restraint actually operates.


Checks and balances presupposes separation of powers because the reciprocal-restraint instruments require pre-existing distinct holders of distributed authority.

Checks and balances equips each holder of distributed authority with explicit tools to constrain the others — veto, review, audit, override — producing reciprocal mutual restraint. This presupposes that authority has already been distributed across separate holders rather than concentrated in one: without the prior division of governmental function into distinct branches or roles, there would be no separate parties between which restraint instruments could be reciprocally exchanged. Separation of powers supplies the distributed-authority substrate that checks and balances operates on as a mesh of mutual constraint.


The heuristic applies because the retained structure's function and the consequences of removal are uncertain. Uncertainty supplies the prerequisite condition: Incomplete knowledge. Chesterton's Fence operates against that background: The persistence of a structure is evidence that it encodes a constraint, so understand its function before removing it. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption.


Chunking is a specialization of compression in which a set of items is grouped into a single meaningful unit that working memory then tracks as one element.

Chunking is a specialization of compression in which the redundancy being exploited is structural relatedness among items, and the encoding shrinks the count of units working memory must track by binding them into one meaningful chunk. It inherits the general compression commitment that representational length can be reduced when the source contains predictable or relational structure, and specializes by locating the encoding in cognitive working memory: capacity is measured in chunks rather than raw elements, so restructuring raises effective capacity without enlarging the store.


Circuit breaker is a specific kind of constraint, imposing a binding threshold that interrupts flow once a danger level is exceeded.

Circuit breaker is a specialization of constraint. The general pattern restricts admissible configurations to those satisfying a binding condition, with the feasible set as a first-class object. Circuit breaker instantiates this with the binding condition being a threshold on a monitored flow (current, requests, prices): values exceeding the threshold trigger interruption, removing the protected process from operation until reset. The mechanism converts the threshold into an enforced upper bound on flow magnitude. It is constraint operating dynamically as an automatic interrupter at the edge of admissibility, accepting local stoppage as the price of holding the binding condition.


Circuit breaker presupposes feedback because the monitor-trip-reset loop routes the protected flow's state back to control its own continuation.

A circuit breaker watches a flow for a danger threshold and, when crossed, trips to interrupt the protected process until reset. This presupposes feedback: the structural arrangement in which a portion of a system's output is routed back to influence its subsequent input, closing a loop between cause and effect. The monitor observes the flow's current state and conditions the next-cycle behaviour (continue or interrupt) on what it sees. Without feedback's closed loop returning the flow's state to the trip decision, the breaker has no mechanism to act on the flow it is protecting.


A circuit breaker presupposes threshold because its trip behavior requires a pre-defined danger value that, once crossed, triggers active disconnection.

A circuit breaker presupposes threshold because its operation rests on a monitor watching a flow for a defined danger value and, the moment that value is crossed, actively disconnecting the protected process. Without the prior availability of a threshold as a critical input value separating safe from unsafe regimes, there is no defined moment for the breaker to trip, no sharp transition between continued operation and protective interruption. Threshold supplies the input-response discontinuity that the breaker mechanically enforces.


Clearance Rate is the internally governed outbound-flow specialization that removes a measurable stock from a bounded system per unit time.

It separates removal from upstream input and adds first-, zero-, or mixed-order kinetics, pathway vulnerability, half-life, saturation, and clearance-side intervention. After the systems_cybernetics frame is stripped away, the retained structural roles are those of Flow: Structured movement of energy, matter, or information. Clearance Rate adds the local frame and commitments expressed in its identity: The rate at which a bounded system removes substrate is a control surface separable from input, with kinetic regime and vulnerability that input-side reasoning misses. The parent pattern remains recognizable without that vocabulary, while the child is the framed realization of it. That preservation test establishes decomposition rather than taxonomic subsumption.


The client-server model is 'a directed topology laid over a network' — a network supplies nodes/edges, client-server adds initiation/addressability/multiplexing/capability asymmetries. It presupposes the network substrate. Network supplies the prerequisite condition: Models interactions between components. Client Server Model operates against that background: An asymmetric request-response relation in which one party holds a capability and many others initiate to consume it. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption.


Close reading presupposes an interpretive act whose whole-level meaning claims it constrains, but it is the upstream evidence-grounding method rather than a kind of meaning assignment.

The method decomposes an artifact into meaningful marks, treats them as evidence, and binds higher-order claims about the artifact to cited grain. Those claims are interpretations: readings recovered from a representational substrate under an evidential and conventional framework. Without an interpretive claim there is nothing for the grain-first discipline to ground. Close reading is nevertheless the method and posture that constrains the act, not the meaning-assignment act itself.


Clustering is classification specialized to discovering categories from within-group similarity without predefined labels.

Both assign entities to a finite category structure for downstream reasoning. Clustering adds the differentia that group boundaries and labels are outputs inferred from a chosen feature space and similarity rule rather than inputs supplied in advance.


Most clustering operationalizes within-group likeness through a similarity, dissimilarity, kernel, or distance-derived measure, while generative mixture methods can group by likelihood or latent fit without an explicit pairwise similarity.

Centroid, hierarchical, spectral, density, and graph clustering normally require a pairwise or point-to-representative notion of nearness. The relation is only typical because probabilistic mixture and other generative procedures can assign observations by component likelihood or latent-model fit without defining a reusable similarity between pairs of observations.


The clustering illusion is the specific FALSE-POSITIVE mode of pattern_recognition against randomness, diagnosable by the missing null model. A specialization of the pattern-detection faculty (its miscalibration, not the faculty).


Co-location typically presupposes a neighborhood when shared presence is defined by a focal region and proximity rule, though exact same-container cases need no tunable radius. In proximity-defined cases, erase the local window or host boundary and shared location becomes undefined. Co-location relates multiple occupants of a region; neighborhood defines the local window itself. Exact same-address, same-container, and same-locus identities can establish co-location without a separately modeled focal neighborhood or radius.


Co-presence presupposes agents capable of detecting one another and selecting responses to that mutually available state.

Mere simultaneous existence is not co-presence. At least two bounded systems must be able to register the other's availability and condition possible response on that registration. Agency supplies the responsive entities whose mutual availability constitutes the relation.


Coarsening is 'one specific dynamical member' of the scale-dependence family — the boundary-cost-driven consolidation of a population toward fewer-and-larger over time, with characteristic kinetics. scaling_and_scale_dependence is the genus. Scaling and Scale Dependence supplies the genus: Patterns and constraints change qualitatively across different scales. Coarsening preserves that general structure while adding its differentia: Boundary cost drives a population of units toward fewer and larger, content flowing small to large. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


'not generic constraint; the specific geometry of advancing-front and fixed-rear and immobile-subject that produces monotonic compression without exit.' A specialization of constraint with a mobility-asymmetry signature. Constraint supplies the genus: Limits possibilities to guide outcomes. Coastal Squeeze preserves that general structure while adding its differentia: An immobile subject is compressed between an advancing front and a fixed rear, with no exit. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Code-switching is a specialization of contextual mode switching in which the alternation is between distinct linguistic codes triggered by social and pragmatic cues.

Code-switching is a specialization of contextual mode switching in which the available modes are distinct linguistic codes (languages, dialects, registers, jargons) and the contextual cues that select among them are social, pragmatic, and expressive. It inherits the general contextual-mode-switching commitment that an agent maintains a repertoire of modes optimized for classes of contexts and switches into the situationally appropriate one as a coherent bundle, and specializes by fixing the modes to linguistic codes and obeying the morpho-syntactic and sociolinguistic constraints that govern where and with whom switches occur.


Code-Switching is typically a specialization of Remapping, retaining the parent's defining structure while adding the child's specific commitments.

Remapping supplies the genus: A single substrate holds multiple disjoint, context-keyed representations and switches discretely between them on a context cue, preserving inactive ones for later re-entry. Code-Switching preserves that general structure while adding its differentia: Alternate languages. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Coevolution is the specific shape feedback takes when two adapting entities each become persistent selective pressures on each other.

Coevolution is the structurally-particularized form feedback takes in the evolutionary case: each species' adaptation is the output that returns as the input (the changed selective pressure) on its partner, closing a reciprocal loop between cause and effect across generations. It inherits feedback's structural arrangement in which output routes back to influence subsequent input — particularized to the case where the timescale is generational, the variable is the fitness landscape, and the coupling is mutually reinforcing. Mutual entanglement of trajectories is precisely loop closure.


Cognitive Appraisal is the organism-centered species of Evaluation whose object is a situation and whose criteria are goal significance and coping capacity.

Cognitive Appraisal preserves Evaluation's bounded target, criterion-bearing frame, interpretation of relevant features, and action-guiding judgment. Its differentia are psychological: the target is a perceived situation, the frame is the organism's goals and coping resources, and the result organizes emotion and behavior. Evaluation need not involve an organism, emotion, threat, or coping, so the relation is strict subsumption rather than identity.


Cognitive appraisal is the specific shape sensemaking takes when the system constructing the working account is an individual organism under threat or opportunity.

Cognitive appraisal is the specific shape sensemaking takes when the agent is an individual organism evaluating a situation's significance for its own well-being. Sensemaking's general anatomy — extracting cues, bracketing them, constructing a plausible identity-grounded account, committing to a frame for action — is structurally particularized into primary appraisal of threat-or-benefit relevance, secondary appraisal of coping resources, and reappraisal as new information arrives. The general operation of producing a working account under ambiguity is preserved; the specific shape is its embodied, emotion-organizing form in an individual facing a goal-relevant event.


Cognitive appraisal presupposes a mental model because evaluating a situation's significance for one's goals requires an internal representation of the domain to read it against.

Cognitive appraisal presupposes a mental model because evaluating a situation's threat-or-benefit relevance and one's coping resources requires an internal representation of the domain — its components, relationships, causal rules, and the agent's place in it — against which the situation is read. Without a mental model's simplified, runnable representation of how the relevant world works, there would be no internal structure for primary and secondary appraisal to consult. Mental models supply the representational substrate; cognitive appraisal supplies the goal-relevant evaluative reading that the model makes possible.


Cognitive apprenticeship is a specific pedagogy that makes expert tacit cognitive processes observable so novices can practice and internalize them.

Cognitive apprenticeship is a specialization of pedagogy whose distinctive move is externalizing the normally-hidden cognitive processes of experts — through modeling, coaching, scaffolding, articulation, reflection, and exploration in authentic contexts — so that learners can observe and progressively internalize tacit expertise. It inherits pedagogy's general commitment that an instructional agent deliberately structures the learner's encounter with content to cause durable capability change, and adds the specific commitment that the content being structured is precisely the unspoken procedural knowledge that traditional instruction leaves invisible.


Cognitive dissonance is the specific shape homeostasis takes when cognitive consistency is the regulated variable and belief-or-behavior revision is the corrective response.

Cognitive dissonance is the homeostatic particularization for the variable of cognitive consistency among a person's beliefs, behaviors, and self-conceptions: when inconsistency exceeds the acceptable band, an aversive state arises and drives revision of one or more cognitions to restore consistency. Where homeostasis names closed-loop self-regulation around a setpoint generally, dissonance fixes the regulated variable as inter-cognitive consistency and the actuator as belief-change, behavior-change, or trivialization — a particular sensor-comparator-actuator loop operating on the psychological field of cognitions.


Cognitive_dissonance is the SPECIALISATION of the general dissonance prime to the cognitive substrate — fixing the elements (beliefs/behaviour), the rule of fit (cognitive consistency), and the resolution mechanism (revise belief/behaviour/self-image, all flavours of RESOLVE).

cognitive_dissonance is the SPECIALISATION of the general dissonance prime to the cognitive substrate — fixing the elements (beliefs/behaviour), the rule of fit (cognitive consistency), and the resolution mechanism (revise belief/behaviour/self-image, all flavours of RESOLVE). The general prime adds the sustain/reframe/distance options the cognitive child lacks and covers acoustic/colour/software cases with no self or arousal. Add dissonance as parent of cognitive_dissonance.


Cognitive entrenchment is a specific kind of lock-in where accumulated expert schemas make revising mental structures costlier than continuing with them.

Cognitive entrenchment is a specialization of lock-in. The general pattern is that the forward-looking cost of switching from a current commitment exceeds continuing, because accumulated investment does not transfer to alternatives. Cognitive entrenchment instantiates this with the commitment being internalized mental models, procedures, and category structures from accumulated domain expertise; the non-transferable accumulation is the schema base itself. Revising toward novel representations costs more than continuing with proceduralized expertise, even when the domain has shifted and a different representation would now be superior.


Cognitive Entrenchment presupposes Mental Model: the entrenched structure is precisely a deeply internalized mental model of the domain.

Cognitive entrenchment is the condition in which long expertise produces deeply internalized mental models, procedures, and category structures that resist revision when the domain shifts. The thing that becomes entrenched is the agent's representation of how the domain works — its components, relationships, and inferential rules — which is exactly a Mental Model. Cognitive entrenchment presupposes mental model as the object whose stabilization over time is the very phenomenon being named.


Cognitive flexibility is an adaptive capacity: detect frame-context misfit and switch the active frame from a held repertoire. A specialization of adaptation in agent-cognitive systems. Adaptation supplies the genus: Systems adjust to conditions. Cognitive Flexibility preserves that general structure while adding its differentia: Switching the active frame from a held repertoire when a trigger detects the current one has stopped fitting the context. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Cognitive Resource Depletion is a kind of scarcity: cognitive capacity becomes insufficient to satisfy simultaneous deliberative demands.

Cognitive resource depletion is the time-dependent degradation of mental capacity under sustained use: as resources are consumed, available capacity falls below the demands of effortful self-regulation and deliberation. That is exactly the Scarcity condition — available quantity insufficient to satisfy simultaneous demands, forcing allocation choices. Cognitive resource depletion specializes scarcity by making the scarce resource a temporally dynamic capacity that depletes with use and replenishes with rest.


Cognitive resource depletion presupposes reserve because depletion is the consumption of a deliberately-held mental capacity buffer.

Cognitive resource depletion is the time-dependent degradation of cognitive capacity through sustained resource consumption without restoration. The construct presupposes that there is a maintained mental capacity available beyond immediate need — a reserve that performance draws from and depletes through use. Reserve supplies that structural object: a deliberately maintained surplus held beyond expected need, used to absorb load. Without an underlying reserve to draw on, depletion would have nothing to deplete from; the inverted-U of performance decay over time presupposes a finite buffer being consumed.


Coherence breakdown under external interaction presupposes dissipation because uncontrolled environmental coupling is the channel through which order leaks away.

Coherence breakdown is the loss of phase alignment or internal coordination when a system couples to an uncontrolled environment, with quantum decoherence as the canonical mechanism. This presupposes dissipation: the systematic, irreversible transformation of organized energy or order into thermalized, un-recoverable form through interaction with many degrees of freedom. The environment's many degrees of freedom are precisely the dissipative sink into which off-diagonal coherence terms flow. Without dissipation's one-way leakage channel, environmental coupling would be reversible and coherence would not break down.


Coherence breakdown under external interaction presupposes environmental coupling strength because its rate is fixed by how strongly the system couples to its environment.

Coherence breakdown under external interaction presupposes environmental coupling strength because the rate at which off-diagonal coherence is suppressed and internal coordination lost is set precisely by how strongly the system is coupled to its environment. Strong coupling means rapid decoherence; weak coupling means the coherent state can be sustained. Without the prior notion of a graded boundary-permeability quantifying how much information or energy crosses the system-environment interface, there is no parameter to govern the breakdown's onset, timescale, or severity.


Coherence breakdown under external interaction presupposes coupling because it occurs precisely when the system becomes dynamically linked to its environment.

Coherence breakdown under external interaction presupposes coupling because the mechanism it names is the dynamic linkage between the coherent system and uncontrolled environmental degrees of freedom: that linkage is what entangles internal phase information with external noise and suppresses off-diagonal coherence. Without the prior availability of coupling as a channel through which state in one subsystem becomes input to another, the system could not be reached by the environment at all, and there would be no pathway by which its coordinated state could be degraded.


Collective effervescence presupposes ritual because the heightened shared emotional state emerges specifically from the synchronized symbolic performance of ritual assembly.

Collective effervescence is the heightened emotional and energetic state arising when individuals gather, synchronize attention and movement, and orient to a sacred symbol — the structural conditions ritual supplies. Without ritual's machinery — rule-governed, repetitive, symbolically charged performance that aligns participants' attention and bodies — the conditions for effervescent intensification would not obtain. The ritual prime provides the synchronized symbolic substrate on which the effervescent state emerges as a recurring sociological mechanism rather than a chance crowd phenomenon.


Collective effervescence is a specialization of emergence in which gathered individuals' synchronized attention produces heightened shared affect transcending individual states.

Collective effervescence is a specialization of emergence. The general emergence pattern is the appearance at a higher level of organization of properties not present in lower-level constituents and not trivially predictable from them. Collective effervescence specializes by naming the constituents — co-present individuals — and the higher-level property — heightened shared emotional energy qualitatively distinct from individual affect, attributed to sacred symbols and generating durable solidarity. The same higher-level-novelty-from-interaction logic applies, with synchronized ritual gathering as the specific interaction rule and ritual energy as the specific emergent property.


Collective efficacy is self-efficacy at the level of a collective agent, adding shared belief and conjoint capability for coordinated group action.

Both are task-specific beliefs by an agent about its own capacity to organize and execute action, affecting effort, persistence, and target selection. The child requires the agent to be plural, the capability to be conjoint rather than additive, and the belief to be sufficiently shared to regulate coordinated group effort.


Collective memory is the specific shape representation takes when a group encodes its shared past through institutions, rituals, and narratives.

Collective memory is the specific shape representation takes when the target is a group's past — events, persons, narratives — and the medium is the distributed system of monuments, holidays, textbooks, rituals, and commemorative practices through which that past is held in common. It is a structurally-particularized instance of structured mapping from target to medium under a faithfulness convention, with the added commitments that the medium is socially distributed rather than individual, the mapping is reproduced across generations through transmission, and the representation feeds back to constitute the group's identity rather than merely standing for an external object.


Collective systemic learning is a specialization of learning in which the agent doing the updating is a multi-component system rather than an individual.

Collective systemic learning is a kind of learning specialized by the locus of the durable update: the learning agent is an organization, team, consortium, or community rather than an individual mind. It inherits learning's general commitment to durable, experience-driven self-update of an agent's internal capability, and adds the specific machinery of system-level acquisition — knowledge capture, integration, embedded processes, structures, documentation, and culture — that makes the update organizational rather than personal and that lets the system as a whole adapt while individual members come and go.


Color harmony presupposes unity and variety because harmonious palettes balance shared color relationships against the differentiation needed for visual interest.

Color harmony presupposes unity and variety because its central achievement — a palette that reads as coordinated rather than discordant — operates by balancing unifying color relationships (analogous hues, shared saturation, consistent value range) against the variety needed to avoid monotony (complementary contrast, triadic span, accent introduction). Without unity-and-variety's prior structure of relational balance between coherence and differentiation, there is no evaluative dimension along which a palette can be judged harmonious. Color harmony inherits this balancing structure and specializes it to the hue, saturation, and value relations of a color set.


A commitment is a reflexive (self-imposed) constraint-creation on one's own future; commitment is a kind-of constraint (the existing commitment_device already sits under constraint). Constraint supplies the genus: Limits possibilities to guide outcomes. Commitment preserves that general structure while adding its differentia: An agent binds itself in the present to a future course of action or to the truth of a proposition, creating a new constraint on future behavior that others can rely on. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


Commitment devices presuppose temporal inconsistency because the strategic self-limitation only makes sense when a later self will be tempted to deviate.

A commitment device is a deliberate restriction of one's future choice set imposed by the present self to bind a later self against tempting deviation. The strategy is only intelligible when later preferences are expected to differ from current ones in a predictable way — when the agent anticipates preference reversal as the future becomes present. Temporal inconsistency names exactly this pattern: the same information and goals produce reversed preferences as horizon shortens. Commitment devices presuppose this dynamic as the threat they are designed to neutralize through preemptive self-binding.


A commitment device presupposes constraint because its function is to deliberately restrict the future feasible set of one's later self.

A commitment device works by deliberately altering the future choice set so that tempting deviations become impossible or costly — voluntarily imposing a binding restriction on one's later admissible actions. Without constraint's machinery of binding restriction on admissible configurations, there would be no structural difference between announcing an intention and locking in a course: the device's whole logic is to convert a soft preference into a hard constraint. The parent prime supplies the binding-restriction structure that the commitment device deploys against time-inconsistent preferences.


Commitment_device is the INTRAPERSONAL-TEMPTATION subcase: a present self foreclosing a tempted future self's options under time-inconsistent preferences.

commitment_device is the INTRAPERSONAL-TEMPTATION subcase: a present self foreclosing a tempted future self's options under time-inconsistent preferences. commitment is the general state, also covering binding to ANOTHER party and to a proposition's truth (a vow, a contract, a database COMMIT) with no present/future-self conflict. Re-parent commitment_device under commitment; it keeps its temporal_inconsistency;constraint parents as composition edges.


Common ground contains common knowledge as its core infinite mutual-recognition invariant, then adds grounding, maintenance, abbreviation, and silent-drift machinery.

Every proposition admitted to the live common-ground substrate satisfies the technical common-knowledge recursion. Common ground is nevertheless a broader maintained interaction structure: grounding moves build and repair that epistemic invariant, its accumulated body licenses abbreviation, and silent drift creates a distinct failure mode. The invariant is therefore a constituent rather than the whole child or merely external context.


Common knowledge contains a hierarchy as its infinite tower of asymmetrically nested belief levels, with each higher rung depending on all lower rungs.

The live epistemic condition is organized as K(p), K(K(p)), and arbitrary higher meta-levels. Each rung has a definite asymmetric position and nests the prior statement; the public event lifts a fact through that level structure to its limit. Hierarchy is therefore the tower's internal organization, while common knowledge adds agents, fact semantics, the lifting threshold, and channel fragility.


Common-Medium Intermediation contains a Network Effect because the shared medium becomes more valuable to every participant as more participants adopt it, producing the threshold and lock-in in its signature.

The N-by-N to N-by-1 collapse explains the medium's combinatorial value, while Network Effect explains adoption and persistence: every new adopter enlarges the set reachable through the medium and therefore raises its value to existing adopters. The live entry treats that self-reinforcement, adoption threshold, and lock-in as constitutive parts of the pattern.


Commons governance is governance specialized to durable community stewardship of a shared resource.

Governance is the general architecture of authority, accountability, decision rights, and dispute resolution. Commons Governance inherits that architecture and adds a shared resource, a community of co-users or contributors, monitoring, congruent rules, graduated sanctions, and nested authority designed to sustain distributed stewardship.


Communication repair is coordination specialized to detecting and restoring divergence in shared understanding over an unreliable channel.

Coordination aligns independently controlled agents or processes so their actions produce a coherent result. Communication repair instantiates that pattern after shared understanding diverges: participants detect the mismatch, pause the primary exchange, use a meta-channel act to restore alignment, and resume. It adds the differentia of an unreliable channel, detected divergence, a repair protocol, and a resumption gate. Every defined communication repair is restorative coordination, although most coordination is not repair.


Communication repair presupposes a channel carrying both the primary exchange and the meta-channel traffic used to detect, repair, and resume after divergence.

Every repair instance exchanges shared state over an unreliable channel, detects divergence in that stream, sends a meta-channel act through the same medium or a back-channel, and reinserts the repaired state. The conduit is external transmission infrastructure, not a repair protocol subtype or an object that depends on repair.


Communication repair contains a feedback loop in which detected divergence is returned through a meta-channel to change the shared state before the primary exchange resumes.

A repair episode observes the state produced by the primary exchange, compares the participants' interpretations, routes evidence of divergence back into the interaction, and uses the response to update shared state. Output from one pass therefore becomes corrective input to the next. The meta-channel, divergence detector, and resumption gate specialize that loop for communication, but without feedback there is no return path by which a misunderstanding can alter the exchange that produced it.


Community-distributed adversarial learning is adversarial boundary navigation performed by a sharing population whose pooled discoveries outpace the principal's rule-update cycle.

Every instance adaptively probes a deployed rule's discoverable boundary for low-cost configurations that preserve the forbidden payload. It adds a distributed adversary population, low-cost sharing, a public-good technique corpus, amortized discovery cost, and a collective learning rate that exceeds the principal's retraining or rule-revision cycle.


Commutativity is a kind of invariance: the result of a binary operation is preserved under the swap-of-operands transformation.

Commutativity says that a o b equals b o a for all elements, so the result of the operation is unchanged under the transformation that swaps the operand order. That is the precise structure of Invariance: a named feature (the operation's value) preserved under a named family of transformations (operand permutation). Commutativity specializes invariance by fixing the operation as a binary combiner and the transformation as the order-swap on its two arguments.


Commutativity is a specialization of symmetry in which the transformation group permutes the operands of a binary operation.

Commutativity is a specialization of symmetry in which the symmetry group is the swap of operands and the operation is left invariant under that swap: a circ b equals b circ a for all operands. It inherits the general symmetry commitment that a system is invariant under a specified group action, and specializes by fixing the group to the two-element permutation of operands of a binary operation. When this swap symmetry holds, sequencing collapses one dimension and unlocks reordering, parallelization, and algebraic manipulations unavailable in non-commutative settings.


Comparative advantage presupposes exchange because the welfare-improving specialization it recommends only materializes when surpluses are actually traded.

Comparative advantage presupposes exchange because the principle recommends specialization based on relative opportunity costs precisely so that the specialized output can be exchanged for surplus from other specialists. Without exchange's bilateral conditional-transfer structure, specialization just produces lopsided autarkic outputs and no mutual gain. Exchange supplies the substrate on which the positive-sum claim is cashed out: the agents involved must trade for the comparative-advantage allocation to be welfare-improving rather than welfare-destroying, so the principle is parasitic on the availability of exchange.


Comparative advantage is the specific shape opportunity cost takes when production decisions are compared across agents with different alternative-use profiles.

Comparative advantage is the specific shape opportunity cost takes when the choice context is the allocation of production across multiple agents, and the relevant comparison is each agent's opportunity cost of producing one good relative to another. It is a structurally-particularized instance of evaluating choices by the value of the best forgone alternative, with the added commitments that the comparison is interpersonal — not within one agent's options but across agents' relative trade-offs — and that the welfare result is positive-sum specialization-and-trade based on relative rather than absolute production efficiencies.


The comparative method is the specific shape comparison takes when it becomes a substitute-for-experiment research design across selected cases.

The comparative method is the specific shape comparison takes when it becomes a systematic research strategy in domains where controlled experimentation is impossible. Comparison's general anatomy — comparands, shared frame, alignment rule, output relation — is structurally particularized into selected societies, eras, or organizations as comparands; Mill's methods of agreement and difference as alignment rules; and inferences about what varies and why as outputs. The general operation is preserved; the specific shape is its disciplined deployment as inferential substitute for randomization through deliberate case selection.


'Equilibrium is the resting-state object comparative statics operates on; comparative statics is the second-order move of comparing two such states... the comparison operator that sits one level above the equilibrium noun.' It presupposes equilibrium. Equilibrium supplies the prerequisite condition: Balanced state. Comparative Statics operates against that background: Compare two equilibria before and after a parameter change, ignoring the path between them. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption.


The comparator that flags divergence between the redundant representations. After the cognitive_science frame is stripped away, the retained structural roles are those of Self Checking: A system detects errors in its own output by computing the answer through partially-independent paths and comparing. Comparison adds the local frame and commitments expressed in its identity: Place items in a shared frame along chosen dimensions to read off a relation between them. The parent pattern remains recognizable without that vocabulary, while the child is the framed realization of it. That preservation test establishes decomposition rather than taxonomic subsumption.


Compellence is a specialization of Coercion, retaining the parent's defining structure while adding the child's specific commitments.

Coercion supplies the genus: Shaping another agent's choice by manipulating the costs and threats attached to their options, so the agent itself 'chooses' the coercer's preferred action — the common parent of forcing an action (compellence) and forcing restraint (deterrence). Compellence preserves that general structure while adding its differentia: Imposing ongoing costs to force a positive action and keeping them live until compliance — the action-demanding counterpart to deterrence, structurally harder because compliance is publicly visible and deadline-bound. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


Competitive niche differentiation is specialization in which narrowing occurs along dimensions that reduce overlap with rivals.

Participants concentrate on a narrower range of resources, users, functions, or performance axes and gain local fit at the cost of general reach. It inherits Specialization's narrowing and performance trade, adding the competitor-relative direction of that narrowing.


Competitive niche differentiation presupposes negatively coupled outcomes over an overlapping stake.

Differentiation is a niche response only when the initial overlap makes success rivalrous and narrowing reduces that coupling. Without competition, different roles may reflect ordinary division of labor or arbitrary variety rather than competitive niche differentiation.


Every Complement strictly presupposes a declared universe, a designated subset, and binary membership from which the residual is defined.

Complement is the residual operation over an already specified universe and subset. It cannot be stated without elements, binary membership, and collection-as-object, but it is not itself the primitive Set and Membership pattern. It adds universe relativity, exhaustive residual formation, and double-complement closure.


Removing population-mapping and measurement-program vocabulary from Complete Enumeration leaves Completeness as its no-required-unit-missing structural criterion.

Strip the defined population, unit identity, measurement passes, provenance, census cost, and domain-specific downstream inferences. What remains is the requirement that the bounded structure contain no gap relative to its declared coverage criterion. Complete Enumeration is the applied discipline that attempts, audits, and exploits this criterion for population mapping; it is not itself a species of the achieved no-gaps property.


Computational complexity is a specific kind of constraint, binding admissible algorithms to those whose resource growth rate keeps problems practically solvable.

Computational complexity is a specialization of constraint. The general pattern restricts admissible configurations to those satisfying a binding condition, with the feasible set as a first-class object. Complexity instantiates this with the binding condition being asymptotic resource growth: algorithms whose time or space scales as polynomial in input size are admissible for large instances, while exponential-time procedures are practically infeasible. The polynomial-versus-exponential boundary partitions the algorithmic feasible set, supplying a machine-independent admissibility criterion that governs which problems can be solved at scale.


Computational complexity is the specific shape scaling takes when the system is an algorithm and the resource cost grows with input size.

Computational complexity is the specific shape scaling and scale dependence takes when the system in question is an algorithm and the property changing qualitatively with size is resource usage -- time or space. The qualitative-shift signature that scale dependence names appears as the polynomial-versus-exponential boundary: an algorithm efficient at small inputs may be infeasible at large ones not from implementation error but from asymptotic growth rate. Big-O classification is the scale-dependence taxonomy of computational systems.


Complexity (Time/Space) is a specialization of Asymptotic Behavior, retaining the parent's defining structure while adding the child's specific commitments.

Asymptotic Behavior supplies the genus: In the limit, only the dominant term matters, so behavior is classified by growth class rather than exact value and small or fast-decaying contributions are discarded. Complexity (Time/Space) preserves that general structure while adding its differentia: Resource scaling with input size. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


Parent's own core_idea enumerates computational time/space complexity as one of its constitutive formalizations. Complexity supplies the genus: Measures system intricacy. Complexity (Time/Space) preserves that general structure while adding its differentia: Resource scaling with input size. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.


Composition presupposes Gestalt principles because deliberate arrangement of elements into a unified whole relies on the perceptual grouping rules Gestalt names.

Composition presupposes Gestalt principles because the orchestration of visual or conceptual elements into a perceived unified whole — its central commitment — works through the perceptual mechanisms by which observers group discrete stimuli into structured wholes: proximity, similarity, continuity, closure, figure-ground, common fate. Without Gestalt's prior grouping operations, the compositional arrangement would register only as a collection of separate items rather than as a coherent ensemble. Composition inherits Gestalt's grouping-rule apparatus and deploys it intentionally, treating the perceptual rules as design levers for guiding attention, weighting elements, and producing coherence.


Compression is a kind of aggregation: it collapses redundant detail into a unified shorter representation while retaining chosen structure.

Compression encodes information in a shorter representation by exploiting redundancy, deliberately losing or restructuring detail to retain the features that matter for reconstruction or downstream use. That is the move of Aggregation: collapsing many items into a unified form that keeps chosen features while suppressing granular detail. Compression specializes aggregation by tying the suppressed detail to redundancy or perceptual unimportance and by holding a reconstruction or fidelity criterion as the design constraint.


Compression is a kind of optimization: it minimizes representation length subject to a reconstruction-fidelity constraint.

Compression seeks the shortest encoding of a source under a chosen fidelity criterion — exact reconstruction for lossless, bounded distortion for lossy — and trades coding cost against quality at the chosen operating point. That is the optimization triplet: decision variable (the encoding), objective (representation length), and constraint (fidelity). Compression specializes optimization to the encoding-length objective, with rate-distortion theory and entropy bounds setting the achievable frontier.


Compression is a specialization of abstraction in which the retained structure is information-theoretic regularity and the discarded structure is the redundancy.

Compression is a specialization of abstraction in which the purpose-relative retention is reduction of representational length: keep the information-theoretic content needed for exact or approximate reconstruction, drop the statistical or perceptual redundancy. It inherits abstraction's general commitment to purpose-relative retention of structure with explicit naming of what is kept and dropped, and specializes by fixing the purpose to storage or transmission economy and the projection to one that shortens symbol count, with the Shannon limit setting the floor on lossless reduction.


Per dossier and file: computability is 'the boundary/meta-level relation that algorithm presupposes' — the existence-question (does an effective procedure exist at all?) over algorithm's central object.

Per dossier + file: computability is 'the boundary/meta-level relation that algorithm presupposes' — the existence-question (does an effective procedure exist at all?) over algorithm's central object. algorithm is the positive object, computability the partition between buildable and provably-unbuildable. Presupposes the notion of effective procedure.


Concentration (massing resources at a decisive point) is a specific allocation strategy within resource management's policy space. Resource Management supplies the genus: Allocation of finite assets. Concentration preserves that general structure while adding its differentia: Massing a divisible resource or effort at the decisive point rather than spreading it thin — the deliberate creation of local superiority by accepting weakness elsewhere. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


A learned rule loses validity OVER TIME — but the RULE is intact and the WORLD moved (the relationship degraded), distinct from the substrate physically decaying. Temporal Decay and Degradation supplies the prerequisite condition: System properties or capabilities systematically diminish over time. Concept Drift operates against that background: A learned rule silently loses validity when the input–outcome relationship it was calibrated on changes underneath it. If the parent condition is removed, the child relation becomes undefined or loses the mechanism asserted by this edge; the parent can obtain independently, so the relation is presupposition rather than subsumption. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.


Concept_drift is 'one substrate-specific case' — the ML instance (a data distribution shifting under a deployed model) of the substrate-neutral non-stationary-objective structure. Non-Stationary Objective supplies the genus: The target moves at a rate comparable to or faster than the system can converge on it, so tracking error replaces steady-state error. Concept Drift preserves that general structure while adding its differentia: A learned rule silently loses validity when the input–outcome relationship it was calibrated on changes underneath it. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.