On minimal ordered structures

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Minimal Ordered Structures

We partially describe minimal, first-order structures which have a strong form of the strict order property. An infinite first-order structure is minimal if its each definable (possibly with parameters) subset is either finite or co-finite. It is strongly minimal if the minimality is preserved in elementarily equivalent structures. While strongly minimal structures were investigated more closel...

متن کامل

On ordered minimal structures

Recall that a structure M is minimal if every definable (with parameters) subset of M is either finite or cofinite. The study of minimal partially ordered structures was initiated by Tanović in [4, 5]. The results from [4, 5] were essential in the proof by Tanović of the Pillay’s conjecture [1], which states that every countable structure in a countable language has infinitely many nonisomorphi...

متن کامل

On dp-minimal ordered structures

We show basic facts about dp-minimal ordered structures. The main results are: dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has non-empty interior, and any theory of pure tree is dp-minimal.

متن کامل

Conference on Ordered Algebraic Structures

For n a positive integer, Ln is the variety of `-groups satisfying the equation [x, y] = e. Many of the well known but striking features of the Ln varieties carry over to varieties satisfying the laws [x, y, z] = e and [x, y, y] = e, such as the structure of finitely generated subdirectly irreducible `-groups and the respective intersections with the representable variety. Some interesting exam...

متن کامل

Minimal Ordered Ramsey Graphs

An ordered graph is a graph equipped with a linear ordering of its vertex set. A pair of ordered graphs is Ramsey finite if it has only finitely many minimal ordered Ramsey graphs and Ramsey infinite otherwise. Here an ordered graph F is an ordered Ramsey graph of a pair (H,H ′) of ordered graphs if for any coloring of the edges of F in colors red and blue there is either a copy of H with all e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publications de l'Institut Mathematique

سال: 2005

ISSN: 0350-1302,1820-7405

DOI: 10.2298/pim0578065t