Mappings with coenumerable graphs Научная публикация
| Журнал |
Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2025, Том: 63, Номер: 6, Страницы: 448-457 Страниц : 10 DOI: 10.1007/s10469-025-09805-1 | ||||
| Ключевые слова | computability, computable permutation, graph | ||||
| Авторы |
|
||||
| Организации |
|
Информация о финансировании (1)
| 1 | Институт математики им. С.Л. Соболева СО РАН | FWNF-2022-0012 |
Реферат:
We study partial mappings on natural numbers, the graphs of which are coenumerable. Such mappings are referred to as negative mappings. We show that any 0-computable partial function is represented as the superposition of two negative ones. We also show that the inverse semigroup of all 0-computable partial injective mappings is generated by its negative elements; moreover, any its element is equal to the product of its two negative elements. We show that the group of all 0-computable permutations is generated by its negative elements. We obtain sufficient conditions for the representability of 0computable permutations in the form of the superposition of two negative permutations.
Библиографическая ссылка:
Morozov A.S.
Mappings with coenumerable graphs
Algebra and Logic. 2025. V.63. N6. P.448-457. DOI: 10.1007/s10469-025-09805-1
Mappings with coenumerable graphs
Algebra and Logic. 2025. V.63. N6. P.448-457. DOI: 10.1007/s10469-025-09805-1
Даты:
| Поступила в редакцию: | 25 апр. 2024 г. |
| Принята к публикации: | 19 мар. 2025 г. |
| Опубликована в печати: | 4 нояб. 2025 г. |
| Опубликована online: | 4 нояб. 2025 г. |
Идентификаторы БД:
Нет идентификаторов
Цитирование в БД:
Пока нет цитирований