We re-express a previous general result in a way which seems easier to remember, using the terminology of infinite games. We show how this can be applied to construct recursive linear orderings, showing, for example, that if there is a linear ordering of type τ, then there is a recursive ordering of type ωβ · τ.

There are several areas in recursive algebra and combinatorics in which bounded or recursively bounded -classes have arisen. For our purposes we may define a -class to be a set Path(T) of all infinite paths through a recursive tree T. Here a recursive tree T is just a recursive subset of ω<ω, the set of all finite sequences of the natural numbers ω = {0,1,2,…}, which is closed under initial segments. If the tree T is finitely branching, then we say the -class Path(T) is bounded. If T is highly recursive, i.e., if there exists a partial recursive function f: T→ω such that for each node ηЄ T, f(η) equals the number of immediate successors of η, then we say that the -class Path(T) is recursively bounded (r.b.). For example, Manaster and Rosenstein in [6] studied the effective version of the marriage problem and showed that the set of proper marriages for a recursive society S was always a bounded -class and the set of proper marriages for a highly recursive society was always an r.b. -class. Indeed, Manaster and Rosenstein showed that, in the case of the symmetric marriage problem, any r.b. -class could be represented as the set of symmetric marriages of a highly recursive society S in the sense that given any r.b. Π1-class C there is a society Sc such that there is a natural, effective, degree-preserving 1:1 correspondence between the elements of C and the symmetric marriages of Sc. Jockusch conjectured that the set of marriages of a recursive society can represent any bounded -class and the set of marriages of a highly recursive society can represent any r.b. -class. These conjectures remain open. However, Metakides and Nerode [7] showed that any r.b. -class could be represented by the set of total orderings of a recursive real field and vice versa that the set of total orderings of a recursive real field is always an r.b. -class.

Let π be a set of primes. We will call a group π-separated if it can be decomposed as a central product of a π-torsion group of bounded exponent and a π-radicable group. It is easy to see that an abelian π-separated group can in fact be decomposed as a direct product of bounded and π-radicable factors (Lemma 1.1 below). A poly-π-separated group is one which can be obtained from π-separated groups by forming a finite series of group extensions. We will show here:

Theorem 1. Every poly-π-separated nilpotent group is π-separated.

The need for such a result arises in model theory in the case that π is the set of all primes, in which case we refer simply to separated and poly-separated groups. In connection with the conjecture that ω-stable simple groups are algebraic, it is useful to have a structure theory for solvable ω-stable groups analogous to the theory available in the algebraic case over algebraically closed fields. In particular the structure of nilpotent ω-stable groups is of interest, for example in connection with the known result [Zi1], [Ne] that the derived subgroup of a connected solvable ω-stable group of finite Morley rank is nilpotent.

As a model-theoretic application of Theorem 1 we obtain:

Theorem 2. If G is an ω-stable nilpotent group then G may be decomposed as a central product B * D with B and D 0-definable subgroups, B torsion of bounded exponent, and D radicable. In particular, B and D are ω-stable. Furthermore, ω · rk(B ∩ D) ≤ rk D.

Corollary. The ω-stable groups of finite Morley rank are exactly the central products B * D of ω-stable nilpotent groups of finite Morley rank with B torsion of bounded exponent, D radicable, and B ∩ D finite.

In addition to the purely algebraic Theorem 1, these results depend on Macintyre's characterization [Mac] of the ω-stable abelian groups as exactly the separated ones.

For several subsystems of second order arithmetic T we show that the proof-theoretic strength of T + (bar rule) can be characterized in terms of T + (bar induction)□, where the latter scheme arises from the scheme of bar induction by restricting it to well-orderings with no parameters. In addition, we demonstrate that , ACA0 + (bar rule) and ACA0 + (bar induction)□ prove the same -sentences.

In this paper we study a certain class of Lie algebras over commutative von Neumann algebras satisfying a certain finiteness condition. By using Boolean valued methods developed by Takeuti [8]−[11], we will establish the basic structure and representation theorems.

Let X and Y be uncountable Polish spaces. We show in ZF that there is a coanalytic subset P of X × Y with countable sections which cannot be expressed as the union of countably many partial coanalytic, or even PCA = , graphs. If X = Y = ωω, P may be taken to be . Assuming stronger set theoretic axioms, we identify the least pointclass such that any such coanalytic P can be expressed as the union of countably many graphs in this pointclass. This last result is extended (under suitable hypotheses) to all levels of the projective hierarchy.