One Question of the Theory of Numbered Groups

N. Kh. KasymovMirzo Ulugbek National University, Tashkent, Uzbekistan

Siberian Mathematical Journaljournal2025en

Ochiq kirish: yoʻq

ABI

Annotatsiya

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.

Hali tarjima qilinmagan

Mavzular

Computability, Logic, AI Algorithms semigroups and automata theory History and Theory of Mathematics

Identifikatorlar

DOI: 10.1134/s0037446625020077

Iqtiboslar va manbalar

0 ta iqtibos6 ta foydalanilgan manba