Работы, цитирующие эту работу

Работ: 2

Работа: Algebraic Systems

1. Locally finite and finitely approximated unoids over computably separable equivalences

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2024Цитирований: 1

   ABIABI:AkademIndex/openalex/2024.article.003415

2. Separable numberings of universal algebras

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.003416