Number of the records: 1  

Free Boolean algebras over unions of two well orderings

  1. 1.
    SYSNO ASEP0333038
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleFree Boolean algebras over unions of two well orderings
    TitleBooleovské algebry nad sjednocením dvou dobrých uspořádání
    Author(s) Bonnet, R. (FR)
    Faouzi, L. (MA)
    Kubiś, Wieslaw (MU-W) RID, ORCID, SAI
    Source TitleTopology and its Applications. - : Elsevier - ISSN 0166-8641
    Roč. 156, č. 7 (2009), s. 1177-1185
    Number of pages9 s.
    Languageeng - English
    CountryNL - Netherlands
    KeywordsWell quasi orderings ; Poset algebras ; Superatomic Boolean algebras ; Compact distributive lattices
    Subject RIVBA - General Mathematics
    CEZAV0Z10190503 - MU-W (2005-2011)
    UT WOS000264904500003
    DOI10.1016/j.topol.2008.12.01
    AnnotationGiven a partially ordered set P there exists the most general Boolean algebra (F) over cap (P) which contains P as a generating set, called the free Boolean algebra over P. We study free Boolean algebras over posets of the form P = P-0 boolean OR P-1, where P-0, P-1 are well orderings. We call them nearly ordinal algebras. Answering a question of Maurice Pouzet, we show that for every uncountable cardinal kappa there are 2(kappa) pairwise non-isomorphic nearly ordinal algebras of cardinality kappa. Topologically, free Boolean algebras over posets correspond to compact 0-dimensional distributive lattices. In this context, we classify all closed sublattices of the product (omega(1) + 1) x (omega(1) + 1), showing that there are only N-1 many types. In contrast with the last result, we show that there are 2(N)1, topological types of closed subsets of the Tikhonov plank (omega(1) + 1) x (omega + 1).
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.