In this note we shall prove

Theorem 0.1. Letbe a countably ω-iterable-mouse which satisfies AD, and [α, β] a weak gap of. Supposeis captured by mice with iteration strategies in ∣α. Let n be least such that ; then we have that believes that has the Scale Property.

This complements the work of [5] on the construction of scales of minimal complexity on sets of reals in K(ℝ). Theorem 0.1 was proved there under the stronger hypothesis that all sets definable over are determined, although without the capturing hypothesis. (See [5, Theorem 4.14].) Unfortunately, this is more determinacy than would be available as an induction hypothesis in a core model induction. The capturing hypothesis, on the other hand, is available in such a situation. Since core model inductions are one of the principal applications of the construction of optimal scales, it is important to prove 0.1 as stated.

Our proof will incorporate a number of ideas due to Woodin which figure prominently in the weak gap case of the core model induction. It relies also on the connection between scales and iteration strategies with the Dodd-Jensen property first discovered in [3]. Let be the pointclass at the beginning of the weak gap referred to in 0.1. In section 1, we use Woodin's ideas to construct a Γ-full a mouse having ω Woodin cardinals cofinal in its ordinals, together with an iteration strategy Σ which condenses well in the sense of [4, Def. 1.13]. In section 2, we construct the desired scale from and Σ.

We study the partition relation that is a weakening of the usual partition relation . Our main result asserts that if κ is an uncountable strongly compact cardinal and , then does not hold.

In intuitionistic analysis, Brouwer's Continuity Principle implies, together with an Axiom of Countable Choice, that the positively Borel sets form a genuinely growing hierarchy: every level of the hierarchy contains sets that do not occur at any lower level.

We show that a set has an η-representation in a linear order if and only if it is the range of a 0′-computable limitwise monotonic function. We also construct a Δ3 Turing degree for which no set in that degree has a strong η-representation, answering a question posed by Downey.

The Inner Model Hypothesis (IMH) and the Strong Inner Model Hypothesis (SIMH) were introduced in [4]. In this article we establish some upper and lower bounds for their consistency strength.

We repeat the statement of the IMH, as presented in [4]. A sentence in the language of set theory is internally consistent iff it holds in some (not necessarily proper) inner model. The meaning of internal consistency depends on what inner models exist: If we enlarge the universe, it is possible that more statements become internally consistent. The Inner Model Hypothesis asserts that the universe has been maximised with respect to internal consistency:

The Inner Model Hypothesis (IMH): If a statement φ without parameters holds in an inner model of some outer model of V (i.e., in some model compatible with V), then it already holds in some inner model of V.

Equivalently: If φ is internally consistent in some outer model of V then it is already internally consistent in V. This is formalised as follows. Regard V as a countable model of Gödel-Bernays class theory, endowed with countably many sets and classes. Suppose that V* is another such model, with the same ordinals as V. Then V* is an outer model of V (V is an inner model of V*) iff the sets of V* include the sets of V and the classes of V* include the classes of V. V* is compatible with V iff V and V* have a common outer model.

We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation and cylindric algebras of dimension n (for finite n > 2) with the additional property that they are one-generated and the set of all n by n atomic matrices forms a cylindric basis. We use this construction to show that the classical Henkin-Orey omitting types theorem fails for the finite variable fragments of first order logic as long as the number of variables available is > 2 and we have a binary relation symbol in our language. We also prove a stronger result to the effect that there is no finite upper bound for the extra variables needed in the witness formulas. This result further emphasizes the ongoing interplay between algebraic logic and first order logic.

By using finite support iteration of Suslin c.c.c forcing notions we construct several models which satisfy some ◊-like principles while other cardinal invariants are larger than ω1.

In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone. We reduce certain recursion schemes (mixed/pure iteration without parameters) and we characterize one-argument primitive recursive functions as the closure under substitution and iteration of certain optimal sets.

We describe which subdirectly irreducible flat algebras arise in the variety generated by an arbitrary class of flat algebras with absorbing bottom element. This is used to give an elementary translation of the universal Horn logic of algebras, partial algebras, and more generally still, partial structures into the equational logic of conventional algebras. A number of examples and corollaries follow. For example, the problem of deciding which finite algebras of some fixed type have a finite basis for their quasi-identities is shown to be equivalent to the finite identity basis problem for the finite members of a finiteiy based variety with definable principal congruences.

We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [ℕ]ℕ, although its Borel chromatic number is ℵ0. We also show that if add(null) = c, then the universally measurable chromatic number of every treeing of a measure amenable equivalence relation is at most three. In particular, this holds for “the” minimum analytic graph with uncountable Borel (and Baire measurable) chromatic number. In contrast, we show that for all κ Є6 (2, 3…..ℵ0, c), there is a treeing of E0 with Borel and Baire measurable chromatic number κ. Finally, we use a Glimm–Effros style dichotomy theorem to show that every basis for a non-empty initial segment of the class of graphs of Borel functions of Borel chromatic number at least three contains a copy of (ℝ<ℕ, ⊇).

We use κ-free but not Whitehead Abelian groups to construct Abstract Elementary Classes (AEC) which satisfy the amalgamation property but fail various conditions on the locality of Galois-types. We introduce the notion that an AEC admits intersections. We conclude that for AEC which admit intersections, the amalgamation property can have no positive effect on locality: there is a transformation of AEC's which preserves non-locality but takes any AEC which admits intersections to one with amalgamation. More specifically we have: Theorem 5.3. There is an AEC with amalgamation which is not (ℵ0, ℵ1)-tame but is (, ∞)-tame; Theorem 3.3. It is consistent with ZFC that there is an AEC with amalgamation which is not (≤ ℵ2, ≤ ℵ2)-compact.

We say that a real X is n-generic relative to a perfect tree T if X is a path through T and for all sets S, there exists a number k such that either X∣k ϵ S or for all a σ ϵ T extending X∣k we have a σ ∉ S. A real X is n-generic relative to some perfect tree if there exists such a T. We first show that for every number n all but countably many reals are n-generic relative to some perfect tree. Second, we show that proving this statement requires ZFC− + “∃ infinitely many iterates of the power set of ω”. Third, we prove that every finite iterate of the hyperjump, , is not 2-generic relative to any perfect tree and for every ordinal α below the least λ such that supβ<λ (βth admissible) = λ, the iterated hyperjump is not 5-generic relative to any perfect tree. Finally, we demonstrate some necessary conditions for reals to be 1-generic relative to some perfect tree.

A monadic formula ψ(Y) is a selector for a formula φ(Y) in a structure if there exists a unique subset P of which satisfies ψ and this P also satisfies φ. We show that for every ordinal α ≥ ωω there are formulas having no selector in the structure (α, <). For α ≤ ω1, we decide which formulas have a selector in (α, <) , and construct selectors for them. We deduce the impossibility of a full generalization of the Büchi-Landweber solvability theorem from (ω, <) to (ωω, <). We state a partial extension of that theorem to all countable ordinals. To each formula we assign a selection degree which measures “how difficult it is to select”. We show that in a countable ordinal all non-selectable formulas share the same degree.

We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formula over the ordinals.

The logic extends first-order logic by a generalized form of counting quantifiers (“the number of elements satisfying … belongs to the set C”). This logic is investigated for structures with an injectively ω-automatic presentation. If first-order logic is extended by an infinity-quantifier, the resulting theory of any such structure is known to be decidable [6]. It is shown that, as in the case of automatic structures [21], also modulo-counting quantifiers as well as infinite cardinality quantifiers (“there are many elements satisfying …”) lead to decidable theories. For a structure of bounded degree with injective ω-automatic presentation, the fragment of that contains only effective quantifiers is shown to be decidable and an elementary algorithm for this decision is presented. Both assumptions (ω-automaticity and bounded degree) are necessary for this result to hold.

If is an analytic family of pairwise eventually different functions then the following strong maximality condition fails: For any countable , no member of which is covered by finitely many functions from , there is such that for all there are infinitely many integers k such that f(k) = h(k). However if V = L then there exists a coanalytic family of pairwise eventually different functions satisfying this strong maximality condition.

In this paper we study the metric spaces that are definable in a polynomially bounded o-minimal structure. We prove that the family of metric spaces definable in a given polynomially bounded o-minimal structure is characterized by the valuation field Λ of the structure. In the last section we prove that the cardinality of this family is that of Λ. In particular these two results answer a conjecture given in [SS] about the countability of the metric types of analytic germs. The proof is a mixture of geometry and model theory.

We show that many singular cardinals λ above a strongly compact cardinal have regular ultrafilters D that violate the finite square principle introduced in [3]. For such ultrafilters D and cardinals λ there are models of size λ for which Mλ/D is not λ++-universal and elementarily equivalent models M and N of size λ for which Mλ/D and Nλ/D are non-isomorphic. The question of the existence of such ultrafilters and models was raised in [1].

We construct a non-discrete Polish group none of whose non-discrete subgroups admits a complete left-invariant metric.

This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly σ-filtered Boolean algebras.

We show that for every uncountable regular cardinal κ there are 2κ pairwise non-isomorphic openly generated Boolean algebras of size κ > ℵ1 provided there is an almost free non-free abelian group of size κ. The openly generated Boolean algebras constructed here are almost free.

Moreover, for every infinite regular cardinal κ we construct 2κ pairwise non-isomorphic Boolean algebras of size κ that are tightly σ-filtered and c.c.c.

These two results contrast nicely with Koppelberg's theorem in [12] that for every uncountable regular cardinal κ there are only 2κ isomorphism types of projective Boolean algebras of size κ.