On Decidable Categoricity for Almost Prime Models of the Signature of Graphs | Sciact - Система учета научной деятельности ИМ СО РАН

On Decidable Categoricity for Almost Prime Models of the Signature of Graphs Научная публикация

Журнал

Siberian Advances in Mathematics
ISSN: 1055-1344 , E-ISSN: 1934-8126

Вых. Данные

Год: 2021, Том: 31, Номер: 4, Страницы: 283-300 Страниц : 18 DOI: 10.1134/S1055134421040039

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

almost prime model; computable model; decidable categoricity; decidable model; degree of decidable categoricity; prime model; spectrum of decidable categoricity

Авторы

Marchuk M.I. ^1,2

Организации

1	Sobolev Institute of Mathematics, Novosibirsk, 630090, Russian Federation
2	Novosibirsk State University, Novosibirsk, 630090, Russian Federation

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

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

20-01-00300

Abstract: We study the degrees of decidable categoricity for almost prime models and theirrelationship with the degrees of the sets of complete formulas. We show that a result ofGoncharov, Harizanov, and Miller for models of infinite signature is valid for models ofthe signature of graphs. © 2021, Pleiades Publishing, Ltd.

Marchuk M.I.
On Decidable Categoricity for Almost Prime Models of the Signature of Graphs
Siberian Advances in Mathematics. 2021. V.31. N4. P.283-300. DOI: 10.1134/S1055134421040039 Scopus OpenAlex

Scopus:	2-s2.0-85121748261
OpenAlex:	W4285357570

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