One Question of the Theory of Numbered Groups

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.

Перевод пока недоступен