Definition
A first-order theory that generalizes stable theories by admitting a well-behaved independence relation (forking) without requiring full stability; simplicity isolates contexts where forking calculus remains usable.
Principle
Principle
Replace the full stability framework with a weaker combinatorial condition that still yields a symmetric, transitive notion of independence for types, enabling an analogue of stability theory's independence calculus.
Demonstration
Demonstration
Many theories of generic structures obtained by controlled amalgamation (for example, certain homogeneous relational structures) are simple: they admit a forking relation satisfying key properties but fail to be stable because they permit more combinatorial diversity.
Misapplication
Misapplication
Assuming that simplicity implies all stable-theory consequences such as strict rank axioms or complete classification by Morley rank; simple theories allow behaviors excluded in stable contexts and require different invariants.
Consequence
Consequence
Simplicity provides a robust independence calculus applicable to dividing and forking, enabling structural analysis of types and models, transfer of combinatorial control to classification arguments, and extension of geometric methods beyond stable theories.
Reversal
Reversal
The opposite are theories where any attempt to define a symmetric, well-behaved independence notion fails (e.g., theories with the tree property) and thus resist forking-based classification.
Boundary
Boundary
Applies to first-order complete theories; simplicity is weaker than stability and different from NIP or o-minimality. It excludes frameworks where dividing/forking behave pathologically or where higher-order features alter independence properties.
Semantic Tension
Semantic Tension
Tension exists with stability (stronger) and with NIP (different axis of tameness): simple theories permit some instability while retaining enough control for an independence calculus, unlike full stability or NIP theories that constrain other combinatorial phenomena.
Synthesis
Synthesis
Simple theories are those first-order theories that, while not necessarily stable, admit a coherent forking/dividing independence apparatus that supports many of the structural and geometric analyses familiar from stability theory.