Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 2009, Volume 9, Issue 2, Pages 30–37
This article is cited in 1 scientific paper (total in 1 paper)
On Constructive Models of Theories with Linear Rudin–Keisler Ordering
A. N. Gavryushkin
Novosibirsk State University
Syntactical characterisation of the class of Ehrenfeucht theories
was got in  by Sudoplatov. It was proved that one can set any
Ehrenfeucht theory by a finite pre-ordering (Rudin–Keisler pre-ordering)
and a function from this pre-ordering to the set of natural numbers as
One of the main results of the paper is the next one. For all
$1\leqslant n\in\omega$ there exists an Ehrenfeucht theory $T_n$ such that
$RK(T_n)\cong L_n$, all quasi-prime models of $T_n$ have no computable
presentations, there exists computably presentable model of $T_n$.
 Sudoplatov, S. V., Complete Theories with Finitely Many Countable Models // Algebra and Logic. 2004. Vol. 43. No. 1. P. 62–69.
PDF file (216 kB)
A. N. Gavryushkin, “On Constructive Models of Theories with Linear Rudin–Keisler Ordering”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 9:2 (2009), 30–37
Citation in format AMSBIB
\paper On Constructive Models of Theories with Linear Rudin--Keisler Ordering
\jour Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
S. S. Goncharov, “On autostability of almost prime models relative to strong constructivizations”, Russian Math. Surveys, 65:5 (2010), 901–935
|Number of views:|