27.04.2015 Views

Computability and Logic

Computability and Logic

Computability and Logic

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

326 RAMSEY’S THEOREM<br />

which tells us that glorified Ramsey’s theorem is undecidable in P, requires a deeper<br />

analysis of nonst<strong>and</strong>ard models than that undertaken in the preceding chapter, <strong>and</strong> is<br />

beyond the scope of a book such as this one.<br />

Problems<br />

26.1 Show that at a party attended by at least nine persons, any two of whom either<br />

like each other or dislike each other, either there are four, any two of whom like<br />

each other, or there are three, any two of whom dislike each other.<br />

26.2 Show that at a party attended by at least eighteen persons, any two of whom<br />

either like each other or dislike each other, either there are four, any two of<br />

whom like each other, or there are four, any two of whom dislike each other.<br />

26.3 A finite set of points in the plane, none lying on the line between any other two,<br />

is said to be convex if no point lies in the interior of the triangle formed by any<br />

three other points, as on the left in Figure 26-3. It is not hard to show that given<br />

Figure 26-3. Convex <strong>and</strong> concave sets of points.<br />

any set of five points in the plane, none lying on the line between any other<br />

two, there is a convex subset of four points. The Erdös–Szekeres theorem states<br />

that, more generally, for any number n > 4 there exists a number m such that<br />

given a set of (at least) m points in the plane, none lying on the line between<br />

any other two, there is a convex subset of (at least) n points. Show how this<br />

theorem follows from Ramsey’s theorem.<br />

26.4 Show that the general case of Ramsey’s theorem follows from the special case<br />

with s = 2, by induction on s.<br />

26.5 For r = s = 2 <strong>and</strong> n = 3, each node in the tree used in the proof of Theorem<br />

26.1 in section 26.2 can be represented by a picture in the style of Figure 26-1.<br />

How many such nodes will there be in the tree?<br />

26.6 Prove König’s lemma directly, that is, without using the compactness theorem,<br />

by considering the subtree T *ofT consisting of all nodes that have infinitely<br />

many nodes above them (where above means either immediately above, or<br />

immediately above something immediately above, or ...).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!