N. D. Markhabatov, Y. R. Baissalov, “A note on pseudofinite acyclic graphs”, Bulletin of Irkutsk State University. Series Mathematics, 2024, Volume 50,Pages <nobr>116

Algebraic and logical methods in computer science and artificial intelligence

A note on pseudofinite acyclic graphs

N. D. Markhabatov^ab, Y. R. Baissalov^a

^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.

UDC: 510.67, 519.17

MSC: 03C50,05C25

Received: 03.04.2024
Accepted: 30.07.2024

Language: English

DOI: 10.26516/1997-7670.2024.50.116