Well ordered subsets of linearly ordered sets (Q1893142)

From MaRDI portal





scientific article; zbMATH DE number 769233
Language Label Description Also known as
default for all languages
No label defined
    English
    Well ordered subsets of linearly ordered sets
    scientific article; zbMATH DE number 769233

      Statements

      Well ordered subsets of linearly ordered sets (English)
      0 references
      3 July 1995
      0 references
      The authors investigate the strength of Davis' theorem LFC in the hierarchy of weak choice principles. LFC is the assertion that linear orders with the fixed point property for monotone mappings are complete. LFC is in strength between CF and DS. Here CF is the axiom that every linearly ordered set has a cofinal well-ordered subset. DS is the statement that a linear ordering without an infinite descending subsequence is a well-ordering. The main result of the paper is the construction of Fraenkel-Mostowski permutation models which show that DS does not imply LFC and LFC does not imply CF.
      0 references
      hierarchy of weak choice principles
      0 references
      LFC
      0 references
      linear orders
      0 references
      fixed point property
      0 references
      CF
      0 references
      DS
      0 references
      well-ordering
      0 references
      Fraenkel-Mostowski permutation models
      0 references
      0 references
      0 references

      Identifiers