RUS  ENG
Full version
JOURNALS // Algebra i logika // Archive

Algebra Logika, 2004 Volume 43, Number 4, Pages 459–481 (Mi al83)

This article is cited in 7 papers

$\Sigma$-Definability in Hereditarily Finite Superstructures and Pairs of Models

A. I. Stukachev

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Abstract: We consider the problem of being $\Sigma$-definable for an uncountable model of a $c$-simple theory in hereditarily finite superstructures over models of another $c$-simple theory. A necessary condition is specified in terms of decidable models and the concept of relative indiscernibility introduced in the paper. A criterion is stated for the uncountable model of a $c$-simple theory to be $\Sigma$-definable in superstructures over dense linear orders, and over infinite models of the empty signature. We prove the existence of a $c$-simple theory (of an infinite signature) every uncountable model of which is not $\Sigma$-definable in superstructures over dense linear orders. Also, a criterion is given for a pair of models to be recursively saturated.

Keywords: $\Sigma$-definability, $c$-simple theory, model, hereditarily finite superstructure, linear order.

UDC: 510.5

Received: 27.01.2003


 English version:
Algebra and Logic, 2004, 43:4, 258–270

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024