![]() ![]() These include graph classes with bounded expansion, which in turn include planar graphs and any graph class of bounded degree. The theory of any nowhere dense graph class.However, Morley showed that (for countable theories) this topological restriction is equivalent to a cardinality restriction, a strong form of stability now called ω -stable. In this proof, the key notion was that of a totally transcendental theory, defined by restricting the topological complexity of the type spaces. Stability theory has its roots in Michael Morley's 1965 proof of Łoś's conjecture on categorical theories. Since types represent the possible behaviors of elements in a theory's models, restricting the number of types restricts the complexity of these models. Stability restricts the complexity of these type spaces by restricting their cardinalities. ![]() One can equivalently analyze the complexity of the Stone duals of these Boolean algebras, which are type spaces. A major direction in model theory is "neostability theory," which tries to generalize the concepts of stability theory to broader contexts, such as simple and NIP theories.Ī common goal in model theory is to study a first-order theory by analyzing the complexity of the Boolean algebras of (parameter) definable sets in its models. Stable theories were the predominant subject of pure model theory from the 1970s through the 1990s, so their study shaped modern model theory and there is a rich framework and set of tools to analyze them. A first step of this program was showing that if a theory is not stable then its models are too numerous to classify. ![]() Stable theories are rooted in the proof of Morley's categoricity theorem and were extensively studied as part of Saharon Shelah's classification theory, which showed a dichotomy that either the models of a theory admit a nice classification or the models are too numerous to have any hope of a reasonable classification. In the mathematical field of model theory, a theory is called stable if it satisfies certain combinatorial restrictions on its complexity. For differential equations, see Stability theory. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |