In this paper the following theorem is proved regarding groups of finite Morley rank which are perfect central extensions of quasisimple algebraic groups.

Theorem 1. Let G be a perfect group of finite Morley rank and let C0be a definable central subgroup of G such that G/C0 is a universal linear algebraic group over an algebraically closed field; that is G is a perfect central extension of finite Morley rank of a universal linear algebraic group. Then C0 = 1.

Contrary to an impression which exists in some circles, the center of the universal extension of a simple algebraic group, as an abstract group, is not finite in general. Thus the finite Morley rank assumption cannot be omitted.

Corollary 1. Let G be a perfect group of finite Morley rank such that G/Z(G) is a quasisimple algebraic group. Then G is an algebraic group. In particular, Z(G) is finite([4], Section 27.5).

An understanding of central extensions of quasisimple linear algebraic groups which are groups of finite Morley rank is necessary for the classification of tame simple K*-groups of finite Morley rank, which constitutes an approach to the Cherlin-Zil’ber conjecture. For this reason the theorem above and its corollary were proven in [1] (Theorems 4.1 and 4.2) under the assumption of tameness, which simplifies the argument considerably. The result of the present paper shows that this assumption can be dropped. The main line of argument is parallel to that in [1]; the absence of the tameness assumption will be countered by a model-theoretic result and results from K-theory. The model-theoretic result places limitations on definability in stable fields, and may possibly be relevant to eliminating certain other uses of tameness.

In a 1969 paper, Quine coined the term ‘limits of decision”. This term evidently refers to limits on the logical vocabulary of a logic, beyond which satisfiability is no longer decidable. In the same paper, Quine showed that not only monadic formulas, but homogeneous k -adic formulas for arbitrary k lie on the decidable side of the limits of decision. But the precise location of the limits of decision has remained an open question. The present paper answers that question. It addresses the question of decidability of those sublogics of first-order logic that are defined in terms of their logical vocabularies. A complete answer is obtained, thus locating exactly Quine's limits of decision.

In this paper, we will present a definability theorem for first order logic. This theorem is very easy to state, and its proof only uses elementary tools. To explain the theorem, let us first observe that if M is a model of a theory T in a language , then, clearly, any definable subset S ⊂ M (i.e., a subset S = {a ∣ M ⊨ φ(a)} defined by some formula φ) is invariant under all automorphisms of M. The same is of course true for subsets of Mn defined by formulas with n free variables.

Our theorem states that, if one allows Boolean valued models, the converse holds. More precisely, for any theory T we will construct a Boolean valued model M, in which precisely the T -provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a formula .

Our presentation is entirely selfcontained, and only requires familiarity with the most elementary properties of model theory. In particular, we have added a first section in which we review the basic definitions concerning Boolean valued models.

We present a cut-elimination proof for simple type theory with an axiom of choice formulated in the language with an epsilon-symbol. The proof is modeled after Takahashi's proof of cut-elimination for simple type theory with extensionality. The same proof works when types are restricted, for example for second-order classical logic with an axiom of choice.

By Frege's Theorem is meant the result, implicit in Frege's Grundlagen, that, for any set E, if there exists a map υ from the power set of E to E satisfying the condition

then E has a subset which is the domain of a model of Peano's axioms for the natural numbers. (This result is proved explicitly, using classical reasoning, in Section 3 of [1].) My purpose in this note is to strengthen this result in two directions: first, the premise will be weakened so as to require only that the map υ be defined on the family of (Kuratowski) finite subsets of the set E, and secondly, the argument will be constructive, i.e., will involve no use of the law of excluded middle. To be precise, we will prove, in constructive (or intuitionistic) set theory, the following

Theorem. Let υ be a map with domain a family of subsets of a set E to E satisfying the following conditions:

(i) ø ϵdom(υ)

(ii)∀U ϵdom(υ)∀x ϵ E − UU ∪ x ϵdom(υ)

(iii)∀UV ϵdom(5) υ(U) = υ(V) ⇔ U ≈ V.

Then we can define a subset N of E which is the domain of a model of Peano's axioms.

We prove that every analytic set in ωω × ωω with σ-bounded sections has a not σ-bounded closed free set. We show that this result is sharp. There exists a closed set with bounded sections which has no dominating analytic free set. and there exists a closed set with non-dominating sections which does not have a not σ-bounded analytic free set. Under projective determinacy analytic can be replaced in the above results by projective.

We will prove that there exists a model of ZFC+“c =” in which every M ⊆ ℝ of cardinality less than continuum c is meager, and such that for every X ⊆ ℝ of cardinality c there exists a continuous function f : ℝ → ℝ with f[X] = [0, 1].

In particular in this model there is no magic set, i.e., a set M ⊆ ℝ such that the equation f[M] = g[M] implies f = g for every continuous nowhere constant functions f,g: ℝ → ℝ.

We prove that any speedable computably enumerable set may be split into a disjoint pair of speedable computably enumerable sets. This solves a longstanding question of J.B. Remmel concerning the behavior of computably enumerable sets in Blum's machine independent complexity theory. We specify dynamic requirements and implement a novel way of detecting speedability—by embedding the relevant measurements into the substage structure of the tree construction. Technical difficulties in satisfying the dynamic requirements lead us to implement “local” strategies that only look down the tree. The (obvious) problems with locality are then resolved by placing an isomorphic copy of the entire priority tree below each strategy (yielding a self-similar tree). This part of the construction could be replaced by an application of the Recursion Theorem, but shows how to achieve the same effect with a more direct construction.

We show that if there is no inner model with a Woodin cardinal and the Steel core model K exists, then every Jónsson cardinal is Ramsey in K, and every δ-Jónsson cardinal is δ5-Erdős in K.

In the absence of the Steel core model K we prove the same conclusion for any model L[] such that either V = L[] is the minimal model for a Woodin cardinal, or there is no inner model with a Woodin cardinal and V is a generic extension of L[].

The proof includes one lemma of independent interest: If V = L[A], where A ⊂ κ and κ is regular, then Lκ[A] is a Jónsson algebra. The proof of this result. Lemma 2.5, is very short and entirely elementary.

We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set A of natural numbers is n-cohesive (respectively, n-r-cohesive) if A is almost homogeneous for every computably enumerable (respectively, computable) 2-coloring of the n-element sets of natural numbers. (Thus the 1-cohesive and 1-r-cohesive sets coincide with the cohesive and r-cohesive sets, respectively.) We consider the degrees of unsolvability and arithmetical definability levels of n-cohesive and n-r-cohesive sets. For example, we show that for all n ≥ 2, there exists a n-cohesive set. We improve this result for n = 2 by showing that there is a 2-cohesive set. We show that the n-cohesive and n-r-cohesive degrees together form a linear, non-collapsing hierarchy of degrees for n ≥ 2. In addition, for n ≥ 2 we characterize the jumps of n-cohesive degrees as exactly the degrees ≥ 0(n+1) and also characterize the jumps of the n-r-cohesive degrees.

In [15], [16] G. Kreisel introduced the no-counterexample interpretation (n.c.i.) of Peano arithmetic. In particular he proved, using a complicated ε-substitution method (due to W. Ackermann), that for every theorem A (A prenex) of first-order Peano arithmetic PA one can find ordinal recursive functionals of order type < ε0 which realize the Herbrand normal form AH of A.

Subsequently more perspicuous proofs of this fact via functional interpretation (combined with normalization) and cut-elimination were found. These proofs however do not carry out the no-counterexample interpretation as a local proof interpretation and don't respect the modus ponens on the level of the nocounterexample interpretation of formulas A and A → B. Closely related to this phenomenon is the fact that both proofs do not establish the condition (δ) and—at least not constructively—(γ) which are part of the definition of an ‘interpretation of a formal system’ as formulated in [15].

We present a variation of the forcing as presented in Woodin [4], Our forcing is a ℙmax-style construction where each model condition selects one Souslin tree. In the extension there is a Souslin tree TG which is the direct limit of the selected Souslin trees in the models of the generic. In some sense, the generic extension is a maximal model of "there exists a minimal Souslin tree,” with TG being this minimal tree. In particular, in the extension this Souslin tree has the property that forcing with it gives a model of Souslin's Hypothesis.

Definition 1.1. Suppose that λ ≤ κ are cardinals and Γ is a subset of (κ, κ+). By , we mean the principle asserting that there is a sequence 〈Fν | ν ∈ lim(Γ)〉 such that for every ν ∈ lim(Γ), the following hold.

(1) 1 ≤ card(Fν) < λ.

(2) The following hold for every C ∈ Fν.

(a) C ⊆ ν ∩ Γ,

(b) C is club in ν,

(c) o.t.(C) ≤ κ,

By we mean . If Γ = (κ, κ+), then we write for and for .

These weak square principles were introduced in [Sch2, 5.1]. They generalize Jensen's principles □κ and , which are equivalent to and respectively. Jensen's global □ principle implies □κ for all κ.

Theorem 1.2. Suppose that is a core model. Assume that every countable premouse M which elementarily embeds into a level of is (ω1 + 1)-iterable. Then, for every κ, holds in .

The minimal non-1-small mouse is essentially a sharp for an inner model with a Woodin cardinal. We originally proved Theorem 1.2 under the assumption that is 1-small, building on [MiSt] and [Sch2]. Some generalizations followed by combining our methods with those of [St2] and [SchSt2]. (For example, the tame countably certified core model Kc satisfies .) In order to eliminate the smallness assumption all together, one replaces our use of the Dodd-Jensen lemma in proofs of condensation properties for with the weak Dodd-Jensen lemma of [NSt].

We calculate the Cantor-Bendixson rank of the Ziegler spectrum over a commutative valuation domain R proving that it is equal to the double Krull dimension of R.

This paper shows that non-normal modal logics can be simulated by certain polymodal normal logics and that polymodal normal logics can be simulated by monomodal (normal) logics. Many properties of logics are shown to be reflected and preserved by such simulations. As a consequence many old and new results in modal logic can be derived in a straightforward way, sheding new light on the power of normal monomodal logic.

This paper continues investigations of the monotone fixed point principle in the context of Feferman's explicit mathematics begun in [14]. Explicit mathematics is a versatile formal framework for representing Bishop-style constructive mathematics and generalized recursion theory. The object of investigation here is the theory of explicit mathematics augmented by the monotone fixed point principle, which asserts that any monotone operation on classifications (Feferman's notion of set) possesses a least fixed point. To be more precise, the new axiom not merely postulates the existence of a least solution, but, by adjoining a new constant to the language, it is ensured that a fixed point is uniformly presentable as a function of the monotone operation. Let T0 + UMID denote this extension of explicit mathematics. [14] gave lower bounds for the strength of two subtheories of To + UMID in relating them to fragments of second order arithmetic based on comprehension. [14] showed that To ↾ + UMID and To ↾ + INDk + UMID have at least the strength of ( – CA), and ↾ and – CA), respectively.

Here we are concerned with the exact reversals. Let UMIDN be the monotone fixed-point principle for subclassifications of the natural numbers. Among other results, it is shown that To ↾ + UMIDN and To ↾ + INDN + UMIDN have the same strength as ( – CA) ↾ and ( – CA), respectively.

The results are achieved by constructing set-theoretic models for the aforementioned systems of explicit mathematics in certain extensions of Kripke-Platek set theory and subsequently relating these set theories to subsystems of second arithmetic.

First we prove that the set of countable linear orders of the form I + I form a complete analytic set. As a consequence of this we improve a result of Humke and Laczkovich, who showed in [HL] that the set of functions of the form f º f form a true analytic set in C[0,1]. We show that these functions form a complete analytic set, solving a problem mentioned on p. 215 of [Kl] and on p. 4 of [B]

It is shown in ZF that if δ < δ+ < Ω are such that δ and δ+ are either both weakly compact or singular cardinals and Ω is large enough for putting the core model apparatus into action then there is an inner model with a Woodin cardinal.

The existence of End Elementary Extensions of modelsM of ZFC is related to the ordinal height of M, according to classical results due to Keisler, Morley and Silver. In this paper, we further investigate the connection between the height of M and the existence of End Elementary Extensions of M. In particular, we prove that the theory ‘ZFC + GCH + there exist measurable cardinals + all inaccessible non weakly compact cardinals are possible heights of models with no End Elementary Extensions’ is consistent relative to the theory ‘ZFC + GCH + there exist measurable cardinals + the weakly compact cardinals are cofinal in ON’. We also provide a simpler coding that destroys GCH but otherwise yields the same result.

We prove that if I is a partially ordered set in a countable transitive model of ZFC then can be extended by a generic sequence of reals ai, i ∈ I, such that is preserved and every ai is Sacks generic over [〈aj: j < i〉]. The structure of the degrees of -constructibility of reals in the extension is investigated.

As applications of the methods involved, we define a cardinal invariant to distinguish product and iterated Sacks extensions, and give a short proof of a theorem (by Budinas) that in ω2-iterated Sacks extension of L the Burgess selection principle for analytic equivalence relations holds.