The uncountable spectra of countable theories
Abstract
Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality . We denote by μ (respectively μ) the number of cardinals (respectively infinite cardinals) less than or equal to . We prove that I(T,), as a function of > 0, is the minimum of 2 and one of the following functions: 1. 2; 2. the constant function 1; 3. |μn/G|-|(μ - 1)n/G| if μ<ω for some 1<n<ω and μ if μ >= ω some group G <= Sym(n); 4. the constant function 2; 5. d+1(μ) for some infinite, countable ordinal d; 6. Σi=1d (i) where d is an integer greater than 0 (the depth of T) and (i) is either d-i-1(μμ) or d-i(μσ(i) + α(i)), where σ(i) is either 1, 0 or 1, and α(i) is 0 or 2; the first possibility for (i) can occur only when d-i > 0.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.