论文标题
最大辅助群的确定性
Definability of maximal cofinitary groups
论文作者
论文摘要
我们提供了第二作者先前宣布的结果的证明，表明有一个封闭（甚至$π^0_1 $）集生成$f_σ$（甚至$σ^0_2 $）最大辅助团体（短，MCG），这是对一个免费组的同构。在这个同构类别中，这是MCG的最低定义复杂性。
We present a proof of a result, previously announced by the second author, that there is a closed (even $Π^0_1$) set generating an $F_σ$ (even $Σ^0_2$) maximal cofinitary group (short, mcg) which is isomorphic to a free group. In this isomorphism class, this is the lowest possible definitional complexity of an mcg.
