|
This article is cited in 6 scientific papers (total in 6 papers)
Spectra of computable models for Ehrenfeucht theories
A. N. Gavryushkin Novosibirsk State University
Abstract:
We construct an example of a theory with a finite (greater than one) number of isomorphism types of countable models such that its prime and saturated models have computable presentations and there exists a model which lacks in such.
Keywords:
Ehrenfeucht theory, countable model, computable presentation of a model.
Received: 10.12.2006
Citation:
A. N. Gavryushkin, “Spectra of computable models for Ehrenfeucht theories”, Algebra Logika, 46:3 (2007), 275–289; Algebra and Logic, 46:3 (2007), 149–157
Linking options:
https://www.mathnet.ru/eng/al297 https://www.mathnet.ru/eng/al/v46/i3/p275
|
Statistics & downloads: |
Abstract page: | 374 | Full-text PDF : | 98 | References: | 59 | First page: | 13 |
|