Publications
Article · Journal of Mathematical Sciences · November 1, 2022
Computable Reducibility for Computable Linear Orders of Type ω
A. Askarbekkyzy, Nikolay A. Bazhenov, Birzhan S Kalmurzayev
Computability, Logic, AI AlgorithmsAdvanced Topology and Set Theorysemigroups and automata theorycomputable reducibilityantichainsautomorphisms
Related publications
- A NOTE ON THE STRUCTURE OF MINIMAL DARK CEERSHerald of Kazakh-British technical university · 2025 · Same author: Aknur Askarbekkyzy
- Punctual numberings for families of setsBULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS · 2024 · Same author: Aknur Askarbekkyzy
- ON THE STRUCTURE OF PUNCTUAL LINEAR ORDERS ISOMORPHIC TO THE LEAST LIMIT ORDINALHerald of Kazakh-British technical university · 2024 · Same author: Aknur Askarbekkyzy
- E -combinations and closures of quite o-minimal theories2025 · Shared topic: Computability, Logic, AI Algorithms