Stability in affine logic

We develop foundational aspects of stability theory in affine logic.On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of nonforking extensions, and other fundamental properties of forking calculus.Most notably, stationarity holds over arbitrary sets (in fact, every type is Lascar strong).On the other hand, we prove that stability is preserved under direct integrals of measurable fields of structures.We deduce that stability in the extremal models of an affine theory implies stability of the theory.We also deduce that the affine part of a stable continuous logic theory is affinely stable, generalising the result of preservation of stability under randomisations.