The complexity of maximal cofinitary groups

DOI10.1090/S0002-9939-08-09526-9zbMath1155.03040MaRDI QIDQ3600613

Bart Kastermans

Publication date: 5 February 2009

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

maximal cofinitary group

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Subgroups of symmetric groups (20B35) Other notions of set-theoretic definability (03E47)

Related Items (7)

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 ⋮ Definable sets of generators in maximal cofinitary groups ⋮ A CO-ANALYTIC COHEN-INDESTRUCTIBLE MAXIMAL COFINITARY GROUP ⋮ Definable towers

Uses Software

• Cofinitary Group

Cites Work

• Infinite combinatorics and definability
• Constructing a maximal cofinitary group
• Uniformity of the meager ideal and maximal cofinitary groups
• Maximal cofinitary groups
• Definable sets of generators in maximal cofinitary groups
• Cofinitary groups, almost disjoint and dominating families
• Isomorphism Types of Maximal Cofinitary Groups
• Embeddings of infinite permutation groups in sharp, highly transitive, and homogeneous groups
• Happy families
• Cofinitary Permutation Groups
• Analytic and coanalytic families of almost disjoint functions

This page was built for publication: The complexity of maximal cofinitary groups