Morley's Categoricity Theorem states that if a first-order theory in a countable language has exactly one model, up to isomorphism, of some uncountable cardinality, then it has exactly one model of every uncountable cardinality. Named for Michael D. Morley, it was a foundational result launching the modern field of model theory, and its later generalization to uncountable languages by Saharon Shelah became a central motivation for stability theory.
Facts
StatementIf a first-order theory in a countable language is categorical in some uncountable cardinality, then it is categorical in all uncountable cardinalities. 1 Classification
Statement FormCharacterization Theorem 1 Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Source Categorical theory
Sources
1. Categorical theory
Lead section, model theory paragraph
if a first-order theory in a countable language is categorical in some uncountable cardinality, then it is categorical in all uncountable cardinalities.
In Branch: Logic and Foundations, Lead sentence
In mathematical logic, a theory is categorical if it has exactly one model (up to isomorphism).
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.