Sciact
  • EN
  • RU

The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas Научная публикация

Журнал Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302
Вых. Данные Год: 2021, Том: 60, Номер: 3, Страницы: 200-206 Страниц : 7 DOI: 10.1007/s10469-021-09642-y
Ключевые слова autostability relative to strong constructivizations; computable categoricity; computable model; decidable categoricity spectrum; decidable model; degree of decidable categoricity; PAdegree
Авторы Goncharov S.S. 1,2 , Marchuk M.I. 1
Организации
1 Sobolev Institute of Mathematics, Novosibirsk, Russian Federation
2 Novosibirsk State University, Novosibirsk, Russian Federation

Реферат: We construct a decidable prime model in which the degree of a set of complete formulas is equal to 0', infinitely many tuples of elements comply with every complete formula, and the decidable categoricity spectrum coincides with the set of all PA-degrees. © 2021, Springer Science+Business Media, LLC, part of Springer Nature.
Библиографическая ссылка: Goncharov S.S. , Marchuk M.I.
The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas
Algebra and Logic. 2021. V.60. N3. P.200-206. DOI: 10.1007/s10469-021-09642-y WOS Scopus OpenAlex
Идентификаторы БД:
Web of science: WOS:000714533400010
Scopus: 2-s2.0-85118544308
OpenAlex: W4225674163
Цитирование в БД:
БД Цитирований
Scopus 1
OpenAlex 1
Web of science 1
Альметрики: