Add to ORKGThe paper is concerned with counting models of superstable theories and simple model expansions of the set chains.The aim is to study the structures of first order counting theories, to choose the classes of counting superstable theories having an isomorphism type continuum of counting models. The sufficient conditions for counting model spectrum maximum of superstable theories have been obtained. The continuumability of non-isomorphic model number of superstable theories at certain stability conditions has been provedAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio
Abstract Following a recent publication, in this paper we count the number of independent operators ...
This thesis looks at characterising countably infinitely categorical theories. That is theories for ...
Note:This thesis is an amalgamation of two compatible topics. The first is a series of results amoun...
The calculation of the countable model automorphism number for uncountable categorical theories is t...
AbstractA first order theory T of power λ is called unidimensional if any twoλ+-saturated models of ...
AbstractLet T be a complete, countable, first-order theory having infinite models. We introduce type...
AbstractWe introduce notions of strong and eventual strong non-isolation for types in countable, sta...
AbstractThe stability theory of first order theories was initiated by Saharon Shelah in 1969. The cl...
AbstractSuppose T is not superstable, T ⊆ T1 (both first-order theories). If λ>∥T1∥ is regular or st...
We prove that several definitions of superstability in abstract elementary classes (AECs) are equiva...
AbstractWe investigate in detail stable formulas, ranks of types and their definability, the f.c.p.,...
A theory formulated in a countable predicate calculus can have at most 2א0 nonisomorphic countable m...
We deal with questions and problems in first order countable model theory. Chapter 1 examines counta...
We consider limit models, i.e., countable models representable as unions of elementary chains of pri...
Abstract. We prove that several definitions of superstability in abstract elementary classes (AECs) ...
Abstract Following a recent publication, in this paper we count the number of independent operators ...
This thesis looks at characterising countably infinitely categorical theories. That is theories for ...
Note:This thesis is an amalgamation of two compatible topics. The first is a series of results amoun...
The calculation of the countable model automorphism number for uncountable categorical theories is t...
AbstractA first order theory T of power λ is called unidimensional if any twoλ+-saturated models of ...
AbstractLet T be a complete, countable, first-order theory having infinite models. We introduce type...
AbstractWe introduce notions of strong and eventual strong non-isolation for types in countable, sta...
AbstractThe stability theory of first order theories was initiated by Saharon Shelah in 1969. The cl...
AbstractSuppose T is not superstable, T ⊆ T1 (both first-order theories). If λ>∥T1∥ is regular or st...
We prove that several definitions of superstability in abstract elementary classes (AECs) are equiva...
AbstractWe investigate in detail stable formulas, ranks of types and their definability, the f.c.p.,...
A theory formulated in a countable predicate calculus can have at most 2א0 nonisomorphic countable m...
We deal with questions and problems in first order countable model theory. Chapter 1 examines counta...
We consider limit models, i.e., countable models representable as unions of elementary chains of pri...
Abstract. We prove that several definitions of superstability in abstract elementary classes (AECs) ...
Abstract Following a recent publication, in this paper we count the number of independent operators ...
This thesis looks at characterising countably infinitely categorical theories. That is theories for ...
Note:This thesis is an amalgamation of two compatible topics. The first is a series of results amoun...