Upward Morley's theorem downward (Q2856635)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6220969
Language Label Description Also known as
default for all languages
No label defined
    English
    Upward Morley's theorem downward
    scientific article; zbMATH DE number 6220969

      Statements

      Upward Morley's theorem downward (English)
      0 references
      0 references
      0 references
      30 October 2013
      0 references
      categoricity
      0 references
      finite models
      0 references
      ultraproducts
      0 references
      This paper studies the possibility to extend Morley's theorem to the finite case. Morley's theorem states that a countable first-order theory is \(\aleph_1\)-categorical if and only if it is \(\kappa\)-categorical for all uncountable \(\kappa\) (for a reference see [\textit{M. Morley}, Trans. Am. Math. Soc. 114, 514--538 (1965; Zbl 0151.01101)]). The authors show that \(\aleph_1\)-categorical theories not necessarily have a unique \(n\)-element model for each finite natural number, up to isomorphism. They present finitary analogues to the notions of elementary substructures and, in their main result (Theorem 1.2.) they show under which conditions a theory can have what they call the \textit{Finite Morley Property} (FMP). A theory \(T\) has the FMP if for every natural number \(n\), \(T\) has at most one \(n\)-element model, up to isomorphism. They introduce a new method of extending elementary maps between certain uncountably categorical structures. In the case of strongly minimal structures, they prove that the conditions on Theorem 1.2. can be simplified. Examples to which their theorem can be applied are infinite dimensional vector spaces over a finite field, and algebraically closed fields of a given positive characteristic.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references