We study definable irreducible actions of SL2 on an abelian group of Morley rank ≤ 3rk and prove they are rational representations of the group.

We offer a simple alternative proof of Theorem II, Kleene [1]:

Theorem. For certain primitive recursive -predicates R and S,

We separate the definitions of < o and O:

Definition 1. (1) 1 <o2; (2) for all y, if 1 <oy, then y <o 2v; (3) for all e, if (n)(Ey)T(e, no, y) and (n)(e(no) <oe((n+1)o)), then (n)(e(no) <o 3·5e); (4) for all x, y, z, if x <oy, y <oz, then x <oz; (5) a <ob only as required by (1)–(4).

Definition 2. a ϵ O if and only if 1 <o 2α.

If we write α(2a·3b) = O for a <ob in Conditions (1) to (4) of Definition 1 and take their conjunction, we get an arithmetic predicate P(α). By the Frege-Dedekind device for handling inductive definitions,

Hence, by Theorem 1 (Part 2) of [2], we have a primitive recursive S such that a <o b ≡ (α)(Ey)S(a, b, α, y). By Definition 2,

The classical use of the function quantifier (α) in the above proof is conspicuous. It is not clear that the constructive or intuitionistic content of Kleene's proof (cf. [1] Footnote 40) can be obtained by this method.

It is well known that many statements provable from combinatorial principles true in the constructible universe L can also be shown to be consistent with ZFC by forcing. Recent work by Shelah and Stanley [4] and the author [5] has clarified the relationship between the axiom of constructibility and forcing by providing Martin's Axiom-type forcing axioms equivalent to ◊ and the existence of morasses. In this paper we continue this line of research by providing a forcing axiom equivalent to □κ. The forcing axiom generalizes easily to inaccessible, non-Mahlo cardinals, and provides the motivation for a corresponding generalization of □κ.

In order to state our forcing axiom, we will need to define a strategic closure condition for partial orders. Suppose P = 〈P, ≤〉 is a partial order. For each ordinal α we will consider a game played by two players, Good and Bad. The players choose, in order, the terms in a descending sequence of conditions 〈pβ∣β < α〉 Good chooses all terms pβ for limit β, and Bad chooses all the others. Bad wins if for some limit β<α, Good is unable to move at stage β because 〈pγ∣γ < β〉 has no lower bound. Otherwise, Good wins. Of course, we will be rooting for Good.

A group is small if it has only countably many complete n-types over the empty set for each natural number n. More generally, a group G is weakly small if it has only countably many complete 1-types over every finite subset of G. We show here that in a weakly small group, subgroups which are definable with parameters lying in a finitely generated algebraic closure satisfy the descending chain conditions for their traces in any finitely generated algebraic closure. An infinite weakly small group has an infinite abelian subgroup, which may not be definable. A small nilpotent group is the central product of a definable divisible group with a definable one of bounded exponent. In a group with simple theory, any set of pairwise commuting elements is contained in a definable finite-by-abelian subgroup. First corollary: a weakly small group with simple theory has an infinite definable finite-by-abelian subgroup. Secondly, in a group with simple theory, a solvable group A of derived length n is contained in an A-definable almost solvable group of class at most 2n – 1.

Let T be an ω1-Souslin tree. We show the property of forcing notions; “is {ω1}-semi-proper and preserves T” is preserved by a new kind of revised countable support iteration of arbitrary length. As an application we have a forcing axiom which is compatible with the existence of an ω1 -Souslin tree for preorders as wide as possible.

We prove that in a nilpotent-by-finite stable group an equation that holds generically holds everywhere. Combining this result with results of Wagner and Bryant, we conclude that a soluble-by-finite stable group of generic exponent n has exponent n.

We show the first examples of recursively enumerable (even decidable) two-dimensional products of finitely axiomatisable modal logics that are not finitely axiomatisable. In particular, we show that any axiomatisation of some bimodal logics that are determined by classes of product frames with linearly ordered first components must be infinite in two senses: It should contain infinitely many propositional variables, and formulas of arbitrarily large modal nesting-depth.

We study the relationships between definitions of compactness in topological spaces and the roll the axiom of choice plays in these relationships.

We prove that in IST, Nelson's internal set theory, the Uniqueness and Collection principles, hold for all (including external) formulas. A corollary of the Collection theorem shows that in IST there are no definable mappings of a set X onto a set Y of greater (not equal) cardinality unless both sets are finite and #(Y) ≤ n #(X) for some standard n. Proofs are based on a rather general technique which may be applied to other nonstandard structures. In particular we prove that in a nonstandard model of PA, Peano arithmetic, every hyperinteger uniquely definable by a formula of the PA language extended by the predicate of standardness, can be defined also by a pure PA formula.

We show that R.J. Thompson’s groups F and T are bi-interpretable with the ring of the integers. From a result by A. Khélif, these groups are quasi-finitely axiomatizable and prime. So, the group T provides an example of a simple group which is quasi-finitely axiomatizable and prime. This answers questions posed by T. Altınel and A. Muranov in [2], and by A. Nies in [12].

This paper is meant to be a comment on Beth's definability theorem. In it we shall make the following points.

Implicit definability as mentioned in Beth's theorem for first-order logic is a special case of a more general notion of uniqueness. If α is a nonlogical constant, T α a set of sentences, α* an additional constant of the same syntactical category as α and T α, a copy of T α with α* instead of α, then for implicit definability of α in T α one has, in the case of predicate constants, to derive α(x 1,…,xn ) ↔ α*(x 1,…,xn ) from T α ∪ T α*, and similarly for constants of other syntactical categories. For uniqueness one considers sets of schemata S α and derivability from instances of S α ∪ S α* in the language with both α and α*, thus allowing mixing of α and α* not only in logical axioms and rules, but also in nonlogical assumptions. In the first case, but not necessarily in the second one, explicit definability follows. It is crucial for Beth's theorem that mixing of α and α* is allowed only inside logic, not outside. This topic will be treated in §1.

Let the structural part of logic be understood roughly in the sense of Gentzen-style proof theory, i.e. as comprising only those rules which do not specifically involve logical constants. If we restrict mixing of α and α* to the structural part of logic which we shall specify precisely, we obtain a different notion of implicit definability for which we can demonstrate a general definability theorem, where a is not confined to the syntactical categories of nonlogical expressions of first-order logic. This definability theorem is a consequence of an equally general interpolation theorem. This topic will be treated in §§2, 3, and 4.

§0. Introduction. We started our study of filters of partitions in [15]. We shall here restrict ourselves to the consideration of filters on (ω)ω, the set of all infinite partitions of ω. §1 is an attempt to elucidate the connection between filters on (ω)ω and filters over ω. Given a filter H over ω, we define two filters FH and GH on (ω)ω, and we characterize p-points, rare ultrafilters and Ramsey ultrafilters in terms of properties of the associated filters of partitions.

The remainder of the paper is devoted to the study of those filters that can be associated with Hindman's theorem and its extensions. Let us introduce some notation. Suppose * is an associative operation on ω, and let a subset A of ω and an ordinal α with 0 < α ≤ ω be given.

In this paper, we continue investigations into the asymptotic behavior of solutions of differential equations over o-minimal structures.

Let ℜ be an expansion of the real field (ℝ, +, ·).

A differentiable map F = (F1,…, F1): (a, b) → ℝi is ℜ-Pfaffian if there exists G: ℝ1+l → ℝl definable in ℜ such that F′(t) = G(t, F(t)) for all t ∈ (a, b) and each component function Gi: ℝ1+l → ℝ is independent of the last l − i variables (i = 1, …, l). If ℜ is o-minimal and F: (a, b) → ℝl is ℜ-Pfaffian, then (ℜ, F) is o-minimal (Proposition 7). We say that F: ℝ → ℝl is ultimately ℜ-Pfaffian if there exists r ∈ ℝ such that the restriction F ↾(r, ∞) is ℜ-Pfaffian. (In general, ultimately abbreviates “for all sufficiently large positive arguments”.)

The structure ℜ is closed under asymptotic integration if for each ultimately non-zero unary (that is, ℝ → ℝ) function f definable in ℜ there is an ultimately differentiable unary function g definable in ℜ such that limt→+∞[g′(t)/f(t)] = 1- If ℜ is closed under asymptotic integration, then ℜ is o-minimal and defines ex: ℝ → ℝ (Proposition 2).

Note that the above definitions make sense for expansions of arbitrary ordered fields.

We show the existence of noncomputable oracles which are low for Demuth randomness, answering a question in [15] (also Problem 5.5.19 in [34]). We fully characterize lowness for Demuth randomness using an appropriate notion of traceability. Central to this characterization is a partial relativization of Demuth randomness, which may be more natural than the fully relativized version. We also show that an oracle is low for weak Demuth randomness if and only if it is computable.

Consider an axiomatic set theory in which there is a distinction between “sets” and “classes,” only sets being allowable as elements. How can one define a finite sequence of classes? This problem was proposed to me by A. Tarski, and a solution is given in this note. We shall assume the axiom system Σ used by Godei in his study of the continuum hypothesis, and shall use the same notation.1

In this paper I show how to develop stability theory within the context of the topological logic first introduced by McKee [Mc 76], Garavaglia [G 78] and Ziegler [Z 76]. I then study some specific applications to topological modules; in particular I prove two quantifier élimination theorems, one a generalization of a result of Garavaglia.

In the first section I present a summary of basic results on topological model theory, mostly taken from the book of Flum and Ziegler [FZ 80]. This is done primarily to fix notation, but I also introduce the notion of an Lt-elementary substructure. The important point with this concept, as with many others, appears to be to allow only individuals to appear as parameters, not open sets.

In the second section I begin the study of stability theory for Lt. I first develop a translation of the topological language Lt into an ordinary first-order language L*. The first main theorem is (2.3), which shows that the translation is faithful to the model-theoretic content of Lt, and provides the necessary tools for studying Lt theories in the context of ordinary first-order logic. The translation allows me to consider individual stability theory for Lt: the stability-theoretic study of those types of Lt in which only individual variables occur freely and in which only individuals occur as parameters. I originally developed this stability theory entirely within Lt; the fact that the theorems and their proofs were virtually identical to those in ordinary first order logic suggested the reduction from Lt to L*.

Levin and Schnorr (independently) introduced the monotone complexity, Km (α), of a binary string α. We use monotone complexity to define the relative complexity (or relative randomness) of reals. We define a partial ordering ≤Km on 2ω by α ≤Km β iff there is a constant c such that Km(α | n) ≤ Km(β | n)+ c for all n. The monotone degree of α is the set of all β such that α Km β and β Km α. We show the monotone degrees contain an antichain of size , a countable dense linear ordering (of degrees of cardinality ), and a minimal pair.

Downey, Hirschfeldt, LaForte, Nies and others have studied a similar structure, the K-degrees, where K is the prefix-free Kolmogorov complexity. A minimal pair of K-degrees was constructed by Csima and Montalban. Of particular interest are the noncomputable trivial reals, first constructed by Solovay. We defineareal to be (Km,K)-trivial if for some constant c, Km(α | n) ≤ K(n) + c for all n. It is not known whether there is a Km-minimal real, but we show that any such real must be (Km,K)-trivial.

Finally, we consider the monotone degrees of the computably enumerable (c.e.) and strongly computably enumerable (s.c.e.) reals. We show there is no minimal c.e. monotone degree and that Solovay reducibility does not imply monotone reducibility on the c.e. reals. We also show the s.c.e. monotone degrees contain an infinite antichain and a countable dense linear ordering.

It is shown that the so called slow growing hierarchy depends non trivially on the choice of its underlying structure of ordinals. To this end we investigate the growth rate behaviour of the slow growing hierarchy along natural subsets of notations for Γ0. Let T be the set-theoretic ordinal notation system for Γ0 and Ttree the tree ordinal representation for Γ0. It is shown in this paper that (Gα)α∈T matches up with the class of functions which are elementary recursive in the Ackermann function as does (by folklore). By thinning out terms in which the addition function symbol occurs we single out subsystems T* ⊆ T and Ttree* ⊆ Ttree (both of order type not exceeding ε0) and prove that still matches up with but now consists of elementary recursive functions only. We discuss the relationship between these results and the Γ0-based termination proof for the standard rewrite system for the Ackermann function.