Adjoining cofinitary permutations

Basit Öğe Kaydı
dc.authorscopusid57223880670
dc.contributor.authorZhang, Y.
dc.date.accessioned2024-07-18T20:17:23Z
dc.date.available2024-07-18T20:17:23Z
dc.date.issued1999
dc.description.abstractWe show that it is consistent with ZFC + ¬CH that there is a maximal cofinitary group (or, maximal almost disjoint group) G ? Sym(?) such that G is a proper subset of an almost disjoint family A ? Sym(?) and |G| < |A|. We also ask several questions in this area.en_US
dc.identifier.doi10.2307/2586812
dc.identifier.endpage1810en_US
dc.identifier.issn0022-4812
dc.identifier.issue4en_US
dc.identifier.scopus2-s2.0-0033268440en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage1803en_US
dc.identifier.urihttps://doi.org/10.2307/2586812
dc.identifier.urihttps://hdl.handle.net/11411/6508
dc.identifier.volume64en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherAssociation for Symbolic Logicen_US
dc.relation.ispartofJournal of Symbolic Logicen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.titleAdjoining cofinitary permutationsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus Indexed Publications