Cardinality questions concerning semilattices of finite breadth (Q789418): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Seymour Z. Ditor / rank
Normal rank
 
Property / author
 
Property / author: Seymour Z. Ditor / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of set-mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur une caractérisation des alephs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551488 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:59, 14 June 2024

scientific article
Language Label Description Also known as
English
Cardinality questions concerning semilattices of finite breadth
scientific article

    Statements

    Cardinality questions concerning semilattices of finite breadth (English)
    0 references
    1984
    0 references
    Let A be a set and \({\mathcal F}(A)\) the finite subsets of A ordered by inclusion. R. Haydon has raised the question: Does there exist a cofinal family \({\mathcal F}_ 0\) (i.e. every G in \({\mathcal F}(A)\) is a subset of some F in \({\mathcal F}_ 0)\) which is closed under finite intersection and is such that for every F in \({\mathcal F}_ 0\) the collection of proper subsets of F which are in \({\mathcal F}_ 0\) has at most two maximal members? In this paper the author reformulates this question about \({\mathcal F}(A)\) in the setting of lattices, and provides a rather interesting answer. The author shows that if L is a lattice in which every element has only finitely many predecessors and not more than k immediate predecessors, for some positive integer k, then L has cardinality \(| L| \leq \aleph_{k-1}\). There are still other questions that remain open. For example, for the lattices mentioned above is \(| L| \leq \aleph_{k-1}\) possible for \(k>2\), or do we always have \(| L| \leq \aleph_ 1?\)
    0 references
    k-lattice
    0 references
    irredundant sequence
    0 references
    breadth
    0 references
    cofinal family
    0 references
    maximal members
    0 references
    predecessors
    0 references
    0 references

    Identifiers