Mappings with coenumerable graphs Full article
| Journal |
Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2025, Volume: 63, Number: 6, Pages: 448-457 Pages count : 10 DOI: 10.1007/s10469-025-09805-1 | ||||
| Tags | computability, computable permutation, graph | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0012 |
Abstract:
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.
Cite:
Morozov A.S.
Mappings with coenumerable graphs
Algebra and Logic. 2025. V.63. N6. P.448-457. DOI: 10.1007/s10469-025-09805-1 WOS Scopus OpenAlex
Mappings with coenumerable graphs
Algebra and Logic. 2025. V.63. N6. P.448-457. DOI: 10.1007/s10469-025-09805-1 WOS Scopus OpenAlex
Dates:
| Submitted: | Apr 25, 2024 |
| Accepted: | Mar 19, 2025 |
| Published print: | Nov 4, 2025 |
| Published online: | Nov 4, 2025 |
Identifiers:
| Web of science: | WOS:001607292700001 |
| Scopus: | 2-s2.0-105020871692 |
| OpenAlex: | W4415835922 |
Citing:
Пока нет цитирований