The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas Full article
| Journal |
Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2021, Volume: 60, Number: 3, Pages: 200-206 Pages count : 7 DOI: 10.1007/s10469-021-09642-y | ||||
| Tags | autostability relative to strong constructivizations; computable categoricity; computable model; decidable categoricity spectrum; decidable model; degree of decidable categoricity; PAdegree | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
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.
Cite:
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
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
Identifiers:
| Web of science: | WOS:000714533400010 |
| Scopus: | 2-s2.0-85118544308 |
| OpenAlex: | W4225674163 |