A sharp increase in representational complexity, computational cost, or number of models that occurs when a previously well-behaved logical fragment is extended by additional operators, constructs, or relaxed syntactic restrictions.

Principle

Fragments are subsets of a logical language chosen for desirable meta-properties (decidability, low complexity). Extending a fragment by adding features (quantifier alternation, transitive closure, counting, higher arity relations) can break those guarantees, causing blowup in satisfiability checking, model size, or reasoning complexity.

Demonstration

Start from a guarded fragment that admits decision procedures with predictable complexity; adding unrestricted binary transitive relations or certain counting quantifiers can make satisfiability move from polynomial/decidable to intractable or undecidable in that fragment. An illustrative instance is an extension that introduces many interacting dependencies and exponentially many witnesses.

Misapplication

Assuming that any modest syntactic extension preserves the original fragment's properties without proof, or blaming tool slowness on blowup when the real issue is poor grounding or encoding choices.

Consequence

Awareness of fragment blowup informs language design, prompting either stricter fragment discipline, feature restrictions, or the use of approximation and modularization; it motivates the search for tight boundaries of tractability.

Reversal

If every extension of a fragment preserved its tame behavior, designers could freely add expressive features without jeopardizing decidability or performance, vastly simplifying language evolution and tool interoperability.

Boundary

Pertains to specific fragments and the particular operators added; it excludes wholesale claims about entire families of logics and depends on fine-grained syntactic and semantic interactions among constructors.

Semantic Tension

Competes with the desire for expressivity: users want richer languages to state concepts succinctly while theorists want fragments with predictable behavior; tension lies in choosing which trade-offs to accept.

Synthesis

Fragment Blowup describes how modest extensions to a carefully chosen logical fragment can suddenly destroy its favorable computational properties, producing leaps in complexity and model multiplicity that force re-evaluation of language features and engineering practices.