On Decidable Categoricity for Almost Prime Models of the Signature of Graphs Full article
| Journal |
Siberian Advances in Mathematics
ISSN: 1055-1344 , E-ISSN: 1934-8126 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2021, Volume: 31, Number: 4, Pages: 283-300 Pages count : 18 DOI: 10.1134/S1055134421040039 | ||||
| Tags | almost prime model; computable model; decidable categoricity; decidable model; degree of decidable categoricity; prime model; spectrum of decidable categoricity | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Russian Foundation for Basic Research | 20-01-00300 |
Abstract:
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.
Cite:
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
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
Identifiers:
| Scopus: | 2-s2.0-85121748261 |
| OpenAlex: | W4285357570 |
Citing:
Пока нет цитирований