Indiscernible extraction and Morley sequences (Q509610)

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 6686422
Language Label Description Also known as
default for all languages
No label defined
    English
    Indiscernible extraction and Morley sequences
    scientific article; zbMATH DE number 6686422

      Statements

      Indiscernible extraction and Morley sequences (English)
      0 references
      0 references
      17 February 2017
      0 references
      The author gives a new proof of the existence of Morley sequences in simple theories. Instead of building a very large independent sequence first and then using the Erdős-Rado theorem together with Morley's method, he only uses Ramsey's theorem and compactness. The construction relies on a property of forcing, called by the author dual finite character. He answers a question asked by \textit{R. Grossberg} et al. [Arch. Math. Logic 41, No. 6, 541--580 (2002; Zbl 1024.03029)] and \textit{J. T. Baldwin} [``How big should the monster model be?'', in: Logic without borders. Essays on set theory, model theory, philosophical logic and philosophy of mathematics. Berlin: De Gruyter. 30--51 (2015; \url{doi:10.1515/9781614516873.31})] .
      0 references
      0 references
      forking
      0 references
      Morley sequences
      0 references
      dual finite character
      0 references
      simple theory
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references