Well ordered subsets of linearly ordered sets (Q1893142): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1305/ndjfl/1040511347 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972055552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of complete lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of ‘Near‐Finite’ Order‐Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definitions of finite / rank
 
Normal rank
Property / cites work
 
Property / cites work: The axiom of choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory. An introduction to independence proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zermelo-Fraenkel consistency results by Fraenkel-Mostowski methods / rank
 
Normal rank

Latest revision as of 15:08, 23 May 2024

scientific article
Language Label Description Also known as
English
Well ordered subsets of linearly ordered sets
scientific article

    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
    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
    0 references