A note on nonmultidimensional superstable theories

1985 ◽  
Vol 50 (4) ◽  
pp. 1020-1024 ◽  
Author(s):  
Anand Pillay ◽  
Charles Steinhorn

In this paper we prove that if T is the complete elementary diagram of a countable structure and is a theory as in the title, then Vaught's conjecture holds for T. This result is Theorem 7, below. In the process of establishing this proposition, in Theorem 3 we give a sufficient condition for a superstable theory having only countably many types without parameters to be ω-stable. Familiarity with the rudiments of stability theory, as presented in [3] and [4], will be supposed throughout. The notation used is, by now, standard.We begin by giving a new proof of a lemma due to J. Saffe in [6]. For T stable, recall that the multiplicity of a type p over a set A ⊆ ℳ ⊨ T is the cardinality of the collection of strong types over A extending p.Lemma 1 (Saffe). Let T be stable, A ⊆ ℳ ⊨ T. If t(b̄, A) has infinite multiplicity and t(c̄, A) has finite multiplicity, then t(b̄, A ∪ {c̄}) has infinite multiplicity.Proof. We suppose not and work for a contradiction. Let ‹b̄γ:γ ≤ α›, α ≥ ω, be a list of elements so that t(b̄γ, A) = t(b̄, A) for all γ ≤ α, and st(b̄γ, A) ≠ st(b̄δ, A) for γ ≠ δ. Furthermore, let c̄γ satisfy t(b̄γ∧c̄γ, A) = t(b̄ ∧ c̄, A) for each γ < α.Since t(c̄, A) has finite multiplicity, we may assume for all γ, δ < α. that st(c̄γ, A) = st(c̄δ, A). For each γ < α there is an automorphism fγ of the so-called “monster model” of T (a sufficiently large, saturated model of T) that preserves strong types over A and is such that f(c̄γ) = c̄0.

1989 ◽  
Vol 54 (3) ◽  
pp. 858-864 ◽  
Author(s):  
A. Pillay

AbstractLet M be a saturated model of a superstable theory and let G = Aut(M). We study subgroups H of G which contain G(A), A the algebraic closure of a finite set, generalizing results of Lascar [L] as well as giving an alternative characterization of the simple superstable theories of [P]. We also make some observations about good, locally modular regular types p in the context of p-simple types.


2013 ◽  
Vol 401-403 ◽  
pp. 1657-1660
Author(s):  
Bin Zhou ◽  
Xiang Wang ◽  
Yu Gao ◽  
Shao Cheng Qu

An adaptive controller with adaptive rate is presented to synchronize two chaos systems and to apply to secure communication. Based on Lyapunov stability theory, a sufficient condition and adaptive control parameters are obtained. Finally, the simulation with synchronization and secure communication is given to show the effectiveness of the proposed method. Keywords: adaptive; synchronization; observer; controller.


Analysis ◽  
2006 ◽  
Vol 26 (1) ◽  
Author(s):  
Stephan Weyers

SummaryIfλ = 1 is an eigenvalue of infinite multiplicity and λ = 2 is an accumulation point of eigenvalues of finite multiplicity. For the


2018 ◽  
Vol 61 (4) ◽  
pp. 909-931
Author(s):  
John Lindsay Orr

AbstractTriangular algebras, and maximal triangular algebras in particular, have been objects of interest for over 50 years. Rich families of examples have been studied in the context of many w*- and C*-algebras, but there remains a dearth of concrete examples in $B({\cal H})$. In previous work, we described a family of maximal triangular algebras of finite multiplicity. Here, we investigate a related family of maximal triangular algebras with infinite multiplicity, and unearth a new asymptotic structure exhibited by these algebras.


2001 ◽  
Vol 66 (2) ◽  
pp. 837-858 ◽  
Author(s):  
Marko Djordjević

We will study complete Ln-theories and their models, where Ln is the set of first order formulas in which at most n distinct variables occur. Here, by a complete Ln-theory we mean a theory such that for every Ln-sentence, it or its negation is implied by the theory. Hence, a complete Ln-theory need not necessarily be complete in the usual sense. Our approach is to transfer concepts and methods from stability theory, such as the order property and counting types, to the context of Ln-theories. So, in one sense, we will develop some rudimentary stability theory for a particular class of (possibly) incomplete theories. To make the ‘stability theoretic’ arguments work, we need to assume that models of the complete Ln-theory T which we consider can be amalgamated in certain ways. If this condition is satisfied and T has infinite models then there will exist models of T which are sufficiently saturated with respect to Ln. This allows us to use some counting types arguments from stability theory. If, moreover, we impose some finiteness conditions on the number of Ln-types and the length of Ln-definable orders then a sufficiently saturated model of T will be ω-categorical and ω-stable. Using the theory of ω-categorical and ω-stable structures we derive that T has arbitrarily large finite models.A different approach to combining stability theory with finite model theory is made by Hyttinen in [9] and [10].


2016 ◽  
Vol 30 (17) ◽  
pp. 1650096 ◽  
Author(s):  
Guanping Wang ◽  
Wuyin Jin ◽  
An Wang

Based on the basic principles of stability theory and Lyapunov function, the condition of complete synchronization in coupled Morris–Lecar (ML) neuronal system with chemical synapses is studied in this work. The boundedness of the model solution is proved by analytical approach, the sufficient condition of the complete synchronization is proposed based on the quadratic of the constructed Lyapunov function and the result is verified by simulations.


2002 ◽  
Vol 67 (1) ◽  
pp. 61-68
Author(s):  
Bradd Hart ◽  
Ehud Hrushovski ◽  
Michael C. Laskowski

By a classifiable theory we shall mean a theory which is superstable, without the dimensional order property, which has prime models over pairs. In order to define what we mean by unique decomposition, we remind the reader of several definitions and results. We adopt the usual conventions of stability theory and work inside a large saturated model of a fixed classifiable theory T; for instance, if we write M ⊆ N for models of T, M and N we are thinking of these models as elementary submodels of this fixed saturated models; so, in particular, M is an elementary submodel of N. Although the results will not depend on it, we will assume that T is countable to ease notation.We do adopt one piece of notation which is not completely standard: if T is classifiable, M0 ⊆ Mi for i = 1, 2 are models of T and M1 is independent from M2 over M0 then we write M1M2 for the prime model over M1 ∪ M2.


2014 ◽  
Vol 28 (04) ◽  
pp. 1450011 ◽  
Author(s):  
XUE-RONG SHI ◽  
ZUOLEI WANG

In this paper, based on Lyapunov stability theory, a novel scheme is proposed to explore the lag synchronization of Coullet system. Via back stepping method, the scheme needs only a single controller and the sufficient condition of synchronization is derived. To illustrate the effectiveness of the proposed scheme, some numerical simulations are presented.


2014 ◽  
Vol 644-650 ◽  
pp. 3485-3488
Author(s):  
Hai Long Huang ◽  
Yan Peng ◽  
Jun Jian Huang

This paper further investigates the problem of synchronization of hyperchaotic memristor-based Chua’s circuits. An active control method is employed to design a controller to achieve the global synchronization of two identical memristor-based systems. Based on Lyapunov stability theory, a sufficient condition is given to guarantee the stability of the synchronization error system.


Sign in / Sign up

Export Citation Format

Share Document