|
Algebraic and logical methods in computer science and artificial intelligence
A note on pseudofinite acyclic graphs
N. D. Markhabatovab, Y. R. Baissalova a L. N. Gumilyov Eurasian National University, Astana, Kazakhstan
b Kazakh-British Technical University, Alma-Ata, Kazakhstan
Abstract:
Acyclic graphs approximated by finite acyclic graphs are considered. It is proved that any countably categorical acyclic graph is smoothly approximable. An example of pseudofinite acyclic graph theory is given, which has an even, odd, and infinite number of rays.
Keywords:
approximation of theory, tree, acyclic graph, pseudofinite theory, smoothly approximated structure, pseudofinite graph.
Received: 03.04.2024 Accepted: 30.07.2024
Citation:
N. D. Markhabatov, Y. R. Baissalov, “A note on pseudofinite acyclic graphs”, Bulletin of Irkutsk State University. Series Mathematics, 50 (2024), 116–124
Linking options:
https://www.mathnet.ru/eng/iigum588 https://www.mathnet.ru/eng/iigum/v50/p116
|
| Statistics & downloads: |
| Abstract page: | 124 | | Full-text PDF : | 64 | | References: | 38 |
|