Scholarlink

<p>We show that the kernel of every numbered group is a&#xa0;permutation computable equivalence.We also prove the existence of a&#xa0;permutation computable equivalence over which no group is definable.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

One Question of the Theory of Numbered Groups

  • 期刊论文

  • 发表日期：

    2025年3月23日

查看全文
  • N. Kh. Kasymov

摘要

We show that the kernel of every numbered group is a permutation computable equivalence.We also prove the existence of a permutation computable equivalence over which no group is definable.