Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/16087
DC FieldValueLanguage
dc.contributor.authorKurilić, Milošen
dc.contributor.authorPavlović A.en
dc.date.accessioned2020-03-03T15:02:32Z-
dc.date.available2020-03-03T15:02:32Z-
dc.date.issued2007-09-01en
dc.identifier.issn01680072en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/16087-
dc.description.abstractA sequence x = 〈 xn : n ∈ ω 〉 of elements of a complete Boolean algebra (briefly c.B.a.) B converges to b ∈ B a priori (in notation x → b) if lim inf x = lim sup x = b. The sequential topology τs on B is the maximal topology on B such that x → b implies x →τs b, where →τs denotes the convergence in the space 〈 B, τs 〉 - the a posteriori convergence. These two forms of convergence, as well as the properties of the sequential topology related to forcing, are investigated. So, the a posteriori convergence is described in terms of killing of tall ideals on ω, and it is shown that the a posteriori convergence is equivalent to the a priori convergence iff forcing by B does not produce new reals. A property (h{stroke}) of c.B.a.'s, satisfying t-cc ⇒ (h{stroke}) ⇒ s-cc and providing an explicit (algebraic) definition of the a posteriori convergence, is isolated. Finally, it is shown that, for an arbitrary c.B.a. B, the space 〈 B, τs 〉 is sequentially compact iff the algebra B has the property (h{stroke}) and does not produce independent reals by forcing, and that s = ω1 implies P (ω) is the unique sequentially compact c.B.a. in the class of Suslin forcing notions. © 2007 Elsevier B.V. All rights reserved.en
dc.relation.ispartofAnnals of Pure and Applied Logicen
dc.titleA posteriori convergence in complete Boolean algebras with the sequential topologyen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.1016/j.apal.2007.05.002en
dc.identifier.scopus2-s2.0-34548421872en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/34548421872en
dc.relation.lastpage62en
dc.relation.firstpage49en
dc.relation.issue1-3en
dc.relation.volume148en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:PMF Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

5
checked on May 10, 2024

Page view(s)

20
Last Week
6
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.