Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-13T23:20:09.640Z Has data issue: false hasContentIssue false

Adjoining cofinitary permutations

Published online by Cambridge University Press:  12 March 2014

Yi Zhang*
Affiliation:
Mathematics Department, Rutgers University, New Brunswick, New Jersey 08903, USAInstitute of Mathematics, Academic Sinica, Beijing, 100080, Peoples Republic of China
*
Department of Mathematics and Computer Science, Istanbul Bilgi University, Inonu Caddesi 28, Kustepe Sisli, Istanbul 80310, Turkey, E-mail: cyzhang@math.rutgers.edu

Abstract

We 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable