If there is a special square sequence then there is a nonspecial one. A square sequence on a regular uncountable cardinal 0 is a sequence (Cc: a < 0) such that: (i) Cc is closed, unbounded in a and C+l = {a}; (ii) if a is a limit point of then Cc = Cfln a; (iii) if C is closed, unbounded in 0, then there is a limit point a of C such that C, Q C n a. By El(0) we denote the statement that a square sequence exists on 0 . Principles of this kind were first considered by Jensen [5]. They have been since then quite frequently used in recursive constructions of various set-theoretical or modeltheoretical structures [3]. Typically, the single linear construction of type 0 is achieved as a limit of 0 separate recursive constructions along the sets Ca 's. By (ii) those recursive steps cohere as if we were doing a single linear construction. The usefulness of this approach stems from the fact that Ca can be a very thin subset of a so the a th recursive step is thus simplified. In our case the thinness of the C 's is controlled by the condition (iii), but in many cases one a actually has that Ca has order type < a. The following is the most basic result concerning the existence of square sequences. Theorem 1 (Jensen). If 0 is not weakly compact in L, then there is a square sequence on 0 which is, moreover, constructible. One can actually show that the square sequence constructed in [5, ?6] satisfies Theorem 1 (see [10, ? 1]). Note that there is always a square sequence on cO . By the condition (ii) the square sequence (C(: a < 0) can essentially be identified with the following tree ordering <2 on 0: a <2 fl iff a is a limit point of Cf. Note that the condition (iii) becomes equivalent to the condition that the tree 0, <2 has no branches of size 0. We shall call (C(: a < 0) a special square Received by the editors February 8, 1988. 1980 Mathematics Subject Classification (1985 Revision). Primary 03E05, 03E10, 03E55. (?) 1989 American Mathematical Society 0002-9939/89 $1.00+ $.25 per page