On Decidable Categoricity for Almost Prime Models of the Signature of Graphs

M. I. Marchuk

doi:10.1134/S1055134421040039

On Decidable Categoricity for Almost Prime Models of the Signature of Graphs

M. I. Marchuk

Section of Discrete Mathematics and Computer Science of MMD and SESC

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	283-300
Number of pages	18
Journal	Siberian Advances in Mathematics
Volume	31
Issue number	4
DOIs	https://doi.org/10.1134/S1055134421040039
Publication status	Published - Oct 2021

Keywords

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

OECD FOS+WOS

1.01 MATHEMATICS

Access to Document

10.1134/S1055134421040039

Cite this

@article{9c1f81e87fe24187bf08f5d101e562c1,

title = "On Decidable Categoricity for Almost Prime Models of the Signature of Graphs",

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.",

keywords = "almost prime model, computable model, decidable categoricity, decidable model, degree of decidable categoricity, prime model, spectrum of decidable categoricity",

author = "Marchuk, {M. I.}",

note = "Funding Information: The work was partially supported by the Russian Foundation for Basic Research (project no. 20-01-00300). Publisher Copyright: {\textcopyright} 2021, Pleiades Publishing, Ltd.",

year = "2021",

month = oct,

doi = "10.1134/S1055134421040039",

language = "English",

volume = "31",

pages = "283--300",

journal = "Siberian Advances in Mathematics",

issn = "1055-1344",

publisher = "PLEIADES PUBLISHING INC",

number = "4",

}

TY - JOUR

T1 - On Decidable Categoricity for Almost Prime Models of the Signature of Graphs

AU - Marchuk, M. I.

PY - 2021/10

Y1 - 2021/10

N2 - 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.

AB - 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.

KW - almost prime model

KW - computable model

KW - decidable categoricity

KW - decidable model

KW - degree of decidable categoricity

KW - prime model

KW - spectrum of decidable categoricity

UR - http://www.scopus.com/inward/record.url?scp=85121748261&partnerID=8YFLogxK

U2 - 10.1134/S1055134421040039

DO - 10.1134/S1055134421040039

M3 - Article

AN - SCOPUS:85121748261

VL - 31

SP - 283

EP - 300

JO - Siberian Advances in Mathematics

JF - Siberian Advances in Mathematics

SN - 1055-1344

IS - 4

ER -

On Decidable Categoricity for Almost Prime Models of the Signature of Graphs

Abstract

Keywords

OECD FOS+WOS

Access to Document

Other files and links

Fingerprint

Cite this