Article

One Question of the Theory of Numbered Groups

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

Siberian Mathematical Journaljournal2025en

ABI

Abstract

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.

Topics

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

Identifiers

DOI: 10.1134/s0037446625020077

Citations and references

Cited by 06 references

Metrics — AkademScholar · Coming soon