On Categoricity Spectra for Locally Finite Graphs | Sciact - Система учета научной деятельности ИМ СО РАН

On Categoricity Spectra for Locally Finite Graphs Научная публикация

Журнал

Siberian Mathematical Journal
ISSN: 0037-4466 , E-ISSN: 1573-9260

Вых. Данные

Год: 2021, Том: 62, Номер: 5, Страницы: 796-804 Страниц : 9 DOI: 10.1134/S0037446621050037

Ключевые слова

510.5; autostability; categoricity spectrum; computable categoricity; computable model; degree of categoricity; locally finite graph

Авторы

Bazhenov N.A. ¹ , Marchuk M.I. ¹

Организации

1	Sobolev Institute of Mathematics, Novosibirsk, Russian Federation

Информация о финансировании (1)

Российский фонд фундаментальных исследований

20-31-70006

Under study is the algorithmic complexity of isomorphisms between computable copiesof locally finite graphs $ G $ (undirected graphs whose every vertex has finite degree).We obtain the following results: If $ G $ has only finitely many components then $ G $is $ {\mathbf{d}} $-computably categorical for every Turing degree $ {\mathbf{d}} $from the class $ PA({\mathbf{0}}^{\prime}) $. If $ G $ has infinitely many components then $ G $is $ {\mathbf{0}}^{\prime\prime} $-computably categorical. We exhibit a series of examplesshowing that the obtained bounds are sharp. © 2021, Pleiades Publishing, Ltd.

Bazhenov N.A. , Marchuk M.I.
On Categoricity Spectra for Locally Finite Graphs
Siberian Mathematical Journal. 2021. V.62. N5. P.796-804. DOI: 10.1134/S0037446621050037 WOS Scopus OpenAlex

Web of science:	WOS:000698762500003
Scopus:	2-s2.0-85115628413
OpenAlex:	W3204193042

Пока нет цитирований