Number of the records: 1  

Quotients of Boolean algebras and regular subalgebras

  1. 1.
    SYSNO ASEP0342828
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleQuotients of Boolean algebras and regular subalgebras
    Author(s) Balcar, Bohuslav (MU-W) RID, SAI
    Pazák, Tomáš (UTIA-B)
    Source TitleArchive for Mathematical Logic. - : Springer - ISSN 0933-5846
    Roč. 49, č. 3 (2010), s. 329-342
    Number of pages14 s.
    Languageeng - English
    CountryDE - Germany
    KeywordsBoolean algebra ; sequential topology ; ZFC extension ; ideal
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA100190509 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    MEB060909 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10190503 - MU-W (2005-2011)
    AV0Z10750506 - UTIA-B (2005-2011)
    UT WOS000276360100004
    EID SCOPUS77952097856
    DOI10.1007/s00153-010-0174-y
    AnnotationLet B and C be Boolean algebras and e : B -> C an embedding. We examine the hierarchy of ideals on C for which (e) over bar : B -> C/I is a regular (i.e. complete) embedding. As an application we deal with the interrelationship between P(omega)/fin in the ground model and in its extension. If M is an extension of V containing a new subset of omega, then in M there is an almost disjoint refinement of the family ([omega](omega))(V). Moreover, there is, in M, exactly one ideal I on omega such that (P(omega)/fin)(V) is a dense subalgebra of (P(omega)/I)(M) if and only if M does not contain an independent (splitting) real. We show that for a generic extension V[G], the canonical embedding P-V(omega)/fin hooked right arrow P(omega)/(U(Os)(B))(G) is a regular one, where U(Os)(B) is the Urysohn closure of the zero-convergence structure on B.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2011
Number of the records: 1  

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