A Partition Theorem for Scattered Order Types

نویسندگان

  • Péter Komjáth
  • Saharon Shelah
چکیده

If φ is a scattered order type, μ a cardinal, then there exists a scattered order type ψ such that ψ → [φ] μ,א0 holds. In this note we prove a Ramsey type statement on scattered order types. A trivial fact on ordinals implies the following statement. If μ is an infinite cardinal, then μ → (μ+)1μ. It is less trivial but still easy to show that if φ is an order type, μ a cardinal then there is some order type ψ that ψ → (φ)1μ holds. One can say that these results show that the classes of ordinals and order types are both Ramsey classes in the natural sense; given a target element and a cardinal for the number of colors, there is another element of the class, which, when colored with the required number of colors, always has a monocolored copy of the target. One can wonder which other classes have similar Ramsey properties. A natural, and well investigated, class in between is the class of scattered order types. For this class, the Ramsey property fails for the following well known and simple reason. There is some scattered order type ψ that for every scattered φ one has φ 6→ [ψ]1ω. See Lemma 1. In this paper we show that this is the most in the negative direction, that is, for every scattered order type φ and cardinal μ there exists a scattered order type ψ such that ψ → [φ]1μ,ω holds. Notation. We use the standard axiomatic set theory notation. If φ, ψ are order types, then φ ≤ ψ denotes that there is an order preserving embedding of φ into ψ, that is, every ordered set of order type ψ has a subset of order type φ. If φ is an order type, then φ denotes the reverse order type, that is, if φ is the order type of (S,<), then φ is the order type of (S,>). ω is the ordinal of the set of natural numbers, (N, <). η is the order type of the set of rational numbers, (Q, <). If φ, ψ are order types, μ is a cardinal, φ → (ψ)1μ denotes the following statement. If (S,<) is an ordered set of order type φ and f : S → μ then for some i < μ the subset f(i) contains a subset of order type ψ. That is, if a Research partially supported by Hungarian National Research Grant T 032455. This research was supported by the Israel Science Foundation. Publication 796.

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

ثبت نام

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

منابع مشابه

On Scattered Posets with Finite Dimension

We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains. Introduction and presentation of the results A fundamental result, due to Szpilrajn [26], states that every order on a set is the intersection of a family of linear orders on this set. The dimension of the order, also called the dimension o...

متن کامل

Approximate approximations from scattered data

The aim of this paper is to extend the approximate quasi-interpolation on a uniform grid by dilated shifts of a smooth and rapidly decaying function on a uniform grid to scattered data quasi-interpolation. It is shown that high order approximation of smooth functions up to some prescribed accuracy is possible, if the basis functions, which are centered at the scattered nodes, are multiplied by ...

متن کامل

Practical Partition-Based Theorem Proving for Large Knowledge Bases

Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often be hand-tuned to answer queries with reasonable performance in practice. Appealing to previous theoretical work on partition-based reasoning, we propose resolutionbased theorem proving strategies that exploit the structur...

متن کامل

Capture Complexity by Partition

We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its natural fragments. The Fagin’s Theorem and Immerman-Vardi’s Theorem are rephrased and strengthened into a uniform partition logic setting. Also the dual operators for the partition quantifiers are introduced to expose ...

متن کامل

Partition properties of the dense local order and a colored version of Milliken's theorem

We study finite dimensional partition properties of the countable homogeneous dense local order (a directed graph closely related to the order structure of the rationals). Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of Milliken’s theorem on trees.

متن کامل

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


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

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2003