|
Sibirskii Matematicheskii Zhurnal, 2010, Volume 51, Number 3, Pages 649–661
(Mi smj2115)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
$\Sigma$-definability of uncountable models of $c$-simple theories
A. I. Stukachevab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Novosibirsk State University, Mechanics and Mathematics Department, Novosibirsk
Abstract:
We show that each $c$-simple theory with an additional discreteness condition has an uncountable model $\Sigma$-definable in $\mathbb{HF}(\mathbb L)$, where $\mathbb L$ is a dense linear order. From this we establish the same for all $c$-simple theories of finite signature that are submodel complete.
Keywords:
computable theory, model theory, constructive model, admissible set.
Received: 08.12.2008
Citation:
A. I. Stukachev, “$\Sigma$-definability of uncountable models of $c$-simple theories”, Sibirsk. Mat. Zh., 51:3 (2010), 649–661; Siberian Math. J., 51:3 (2010), 515–524
Linking options:
https://www.mathnet.ru/eng/smj2115 https://www.mathnet.ru/eng/smj/v51/i3/p649
|
|