Journal of Symbolic Logic

Adjoining Cofinitary Permutations

Yi Zhang

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

We show that it is consistent with ZFC + $\neg$CH that there is a maximal cofinitary group (or, maximal almost disjoint group) G $\leq$ Sym($\omega$) such that G is a proper subset of an almost disjoint family A $\subseteq$ Sym($\omega$) and |G| < |A|. We also ask several questions in this area.

Article information

Source
J. Symbolic Logic, Volume 64, Issue 4 (1999), 1803-1810.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183745953

Mathematical Reviews number (MathSciNet)
MR1780085

Zentralblatt MATH identifier
0944.03049

JSTOR
links.jstor.org

Subjects
Primary: 03E35: Consistency and independence results
Secondary: 20A15: Applications of logic to group theory 20B07: General theory for infinite groups 20B35: Subgroups of symmetric groups

Citation

Zhang, Yi. Adjoining Cofinitary Permutations. J. Symbolic Logic 64 (1999), no. 4, 1803--1810. https://projecteuclid.org/euclid.jsl/1183745953


Export citation