RUS  ENG
Full version
JOURNALS // Sibirskii Matematicheskii Zhurnal // Archive

Sibirsk. Mat. Zh., 2010 Volume 51, Number 3, Pages 649–661 (Mi smj2115)

This article is cited 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.

UDC: 510.5

Received: 08.12.2008


 English version:
Siberian Mathematical Journal, 2010, 51:3, 515–524

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024