The Hanf number for Amalgamation of Coloring Classes

نویسندگان

  • Alexei Kolesnikov
  • Chris Lambie-Hanson
چکیده

We study amalgamation properties in a family of abstract elementary classes that we call coloring classes. The family includes the examples previously studied in [3]. We establish that the amalgamation property is equivalent to the disjoint amalgamation property in all coloring classes; find the Hanf number for the amalgamation property for coloring classes; and improve the results of [3] by showing, in ZFC, that the (disjoint) amalgamation property for classes Kα studied in that paper must hold up to iα (only a consistency result was previously known).

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

ثبت نام

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

منابع مشابه

Hanf Numbers and Presentation Theorems in AEC

Grossberg [Gro02, Conjecture 9.3] has raised the question of the existence of Hanf numbers for joint embedding and amalgamation in Abstract Elementary Classes (AEC). Various authors have given lower bounds (discussed in Section 5), usually for the disjoint version of these properties. Here we show a strongly compact cardinal κ is an upper bound for various such Hanf numbers. We define 4 kinds a...

متن کامل

Categoricity for Abstract Classes with Amalgamation Sh394

Let K be an abstract elementary class with amalgamation, and Lowenheim Skolem number LS(K). We prove that for a suitable Hanf number χ0 if χ0 < λ0 ≤ λ1, and K is categorical in λ + 1 then it is categorical in λ0. 2000 Mathematics Subject Classification. 03C45, 03C75.

متن کامل

Galois-stability for Tame Abstract Elementary Classes

We introduce tame abstract elementary classes as a generalization of all cases of abstract elementary classes that are known to permit development of stability-like theory. In this paper we explore stability results in this new context. We assume that K is a tame abstract elementary class satisfying the amalgamation property with no maximal model. The main results include: Theorem 0.1. Suppose ...

متن کامل

On the Maximum Number of Dominating Classes in Graph Coloring

In this paper we investigate the dominating- -color number،  of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].  

متن کامل

Shelah's categoricity conjecture from a successor for tame abstract elementary classes

We prove a categoricity transfer theorem for tame abstract elementary classes. Theorem 0.1. Suppose that K is a χ-tame abstract elementary class and satisfies the amalgamation and joint embedding properties and has arbitrarily large models. Let λ ≥ Max{χ,LS(K)}. If K is categorical in λ and λ, then K is categorical in λ. Combining this theorem with some results from [Sh 394], we derive a form o...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • J. Symb. Log.

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2016