The complexity of maximal cofinitary groups
From MaRDI portal
Recommendations
Cites work
- Analytic and coanalytic families of almost disjoint functions
- Cofinitary groups, almost disjoint and dominating families
- Cofinitary Permutation Groups
- Constructing a maximal cofinitary group
- Definable sets of generators in maximal cofinitary groups
- Embeddings of infinite permutation groups in sharp, highly transitive, and homogeneous groups
- Happy families
- Infinite combinatorics and definability
- Isomorphism Types of Maximal Cofinitary Groups
- Maximal cofinitary groups
- Uniformity of the meager ideal and maximal cofinitary groups
Cited in
(15)- Constructing a maximal cofinitary group
- Maximal cofinitary groups
- Definable sets of generators in maximal cofinitary groups
- Isomorphism Types of Maximal Cofinitary Groups
- Cofinitary Permutation Groups
- A co-analytic Cohen-indestructible maximal cofinitary group
- Definable towers
- On the scope of the Effros theorem
- COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS
- CONSTRUCTING MAXIMAL COFINITARY GROUPS
- A Borel maximal eventually different family
- Katětov order on \(\mathsf{MAD}\) families
- A Borel maximal cofinitary group
- Good projective witnesses
- Tight cofinitary groups
This page was built for publication: The complexity of maximal cofinitary groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600613)