Categoricity

Mathematical Logic · Axiom Academy

Understanding when theories determine their models up to isomorphism. Categoricity measures how precisely a theory constrains the structure of its models at different cardinalities. In other words, if a theory is κ-categorical, then once you fix the cardinality to be κ, there is essentially only one model (up to isomorphism). The theory completely determines the structure at that size. The Lowenheim-Skolem theorems tell us that if a countable theory has an infinite model of some cardinality, it has models of every infinite cardinality . But models of different sizes cannot be isomorphic. Therefore, no countable theory can be categorical in all infinite cardinalities simultaneously. ω-categoricity (where ω = ℵ₀, the first infinite cardinal) is particularly important in model theory. These theories have a unique countable model, which often makes them easier to analyze and understand. This gives us a powerful tool for checking ω-categoricity: count the types! If there are only finitely many ways elements can satisfy formulas (in groups of n ), then the countable model is unique. 4. Example: Dense Linear Orders (DLO) The rationals (ℚ, <) satisfy DLO. But so do many other structures! For instance, the real numbers ℝ, any open interval in ℝ, or the algebraic numbers all satisfy DLO. 5. Example: Vector Spaces Over Finite Fields This theory has models of every infinite cardinality. But remarkably, it is categorical in every infinite cardinality!

This is the written version of the interactive lesson above. See the full Mathematical Logic course.