Standard

Decidable Models of Ehrenfeucht Theories. / Alaev, P. E.; Khlestova, E. I.

в: Algebra and Logic, 05.05.2025.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Alaev, PE & Khlestova, EI 2025, 'Decidable Models of Ehrenfeucht Theories', Algebra and Logic. https://doi.org/10.1007/s10469-025-09779-0

APA

Alaev, P. E., & Khlestova, E. I. (2025). Decidable Models of Ehrenfeucht Theories. Algebra and Logic. https://doi.org/10.1007/s10469-025-09779-0

Vancouver

Alaev PE, Khlestova EI. Decidable Models of Ehrenfeucht Theories. Algebra and Logic. 2025 май 5. doi: 10.1007/s10469-025-09779-0

Author

Alaev, P. E. ; Khlestova, E. I. / Decidable Models of Ehrenfeucht Theories. в: Algebra and Logic. 2025.

BibTeX

@article{f2801c3485364664b3c868af89f2c5e7,
title = "Decidable Models of Ehrenfeucht Theories",
abstract = "We study countable models of Ehrenfeucht theories, i.e., complete theories with a finite number of countable models, strictly larger than 1. The notion of a primely generated model is introduced. It is proved that if all complete types of an Ehrenfeucht theory have arithmetic complexity, then any of the primely generated models of the theory possesses an arithmetically complex isomorphic presentation.",
keywords = "Ehrenfeucht theory, arithmetic structure, arithmetic type, computable structure, countable model, decidable structure",
author = "Alaev, {P. E.} and Khlestova, {E. I.}",
year = "2025",
month = may,
day = "5",
doi = "10.1007/s10469-025-09779-0",
language = "English",
journal = "Algebra and Logic",
issn = "0002-5232",
publisher = "Springer US",

}

RIS

TY - JOUR

T1 - Decidable Models of Ehrenfeucht Theories

AU - Alaev, P. E.

AU - Khlestova, E. I.

PY - 2025/5/5

Y1 - 2025/5/5

N2 - We study countable models of Ehrenfeucht theories, i.e., complete theories with a finite number of countable models, strictly larger than 1. The notion of a primely generated model is introduced. It is proved that if all complete types of an Ehrenfeucht theory have arithmetic complexity, then any of the primely generated models of the theory possesses an arithmetically complex isomorphic presentation.

AB - We study countable models of Ehrenfeucht theories, i.e., complete theories with a finite number of countable models, strictly larger than 1. The notion of a primely generated model is introduced. It is proved that if all complete types of an Ehrenfeucht theory have arithmetic complexity, then any of the primely generated models of the theory possesses an arithmetically complex isomorphic presentation.

KW - Ehrenfeucht theory

KW - arithmetic structure

KW - arithmetic type

KW - computable structure

KW - countable model

KW - decidable structure

UR - https://www.mendeley.com/catalogue/0c0aa332-7b41-3d46-bee5-239c4bae9ddc/

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-105004356662&origin=inward&txGid=00e69c065212b527cdd855815c11769f

U2 - 10.1007/s10469-025-09779-0

DO - 10.1007/s10469-025-09779-0

M3 - Article

JO - Algebra and Logic

JF - Algebra and Logic

SN - 0002-5232

ER -

ID: 66186918