We establish a coloring theorem for successors of singular cardinals, and use it prove that for any such cardinal μ, we have if and only if for arbitrarily large θ < μ.

We formulate and prove (in ZFC) a strong coloring theorem which holds at successors of singular cardinals, and use it to answer several questions concerning Shelah's principle Pr1 (μ+, μ+, μ+, cf (μ)) for singular μ.

We give the natural topological model for ¬BD-ℕ, and use it to show that the closure of spaces with the anti-Specker property under product does not imply BD-ℕ. Also, the natural topological model for ¬BD is presented. Finally, for some of the realizability models known indirectly to falsify BD-ℕ, it is brought out in detail how BD-ℕ fails.

In this paper we show that there are various pseudo-jump operators definable over inadmissible Jβ that relate to the failure of admissiblity and to non-regularity. We will use these ideas to construct some intermediate degrees.

According to Belegradek, a first order structure is weakly small if there are countably many 1-types over any of its finite subset. We show the following results. A field extension of finite degree of an infinite weakly small field has no Artin-Schreier extension. A weakly small field of characteristic 2 is finite or algebraically closed. A weakly small division ring of positive characteristic is locally finite dimensional over its centre. A weakly small division ring of characteristic 2 is a field.

Recently, Gitik, Kanovei and the first author proved that for a classical Prikry forcing extension the family of the intermediate models can be parametrized by /finite. By modifying the standard Prikry tree forcing we define a Prikry-type forcing which also singularizes a measurable cardinal but which is minimal, i.e., there are no intermediate models properly between the ground model and the generic extension. The proof relies on combining the rigidity of the tree structure with indiscernibility arguments resulting from the normality of the associated measures.

We show that any symmetric, Baire measurable function from the complement of E0 to a finite set is constant on an E0-nonsmooth square. A simultaneous generalization of Galvin's theorem that Baire measurable colorings admit perfect homogeneous sets and the Kanovei-Zapletal theorem canonizing Borel equivalence relations on E0-nonsmooth sets, this result is proved by relating E0-nonsmooth sets to embeddings of the complete binary tree into itself and appealing to a version of Hindman's theorem on the complete binary tree. We also establish several canonization theorems which follow from the main result.

This paper investigates indifferent sets for comeager classes in Cantor space focusing of the class of all 1-generic sets and the class of all weakly 1-generic sets. Jockusch and Posner showed that there exist 1-generic sets that have indifferent sets [10]. Figueira, Miller and Nies have studied indifferent sets for randomness and other notions [7]. We show that any comeager class in Cantor space contains a comeager class with a universal indifferent set. A forcing construction is used to show that any 1-generic set, or weakly 1-generic set, has an indifferent set. Such an indifferent set can by computed by any set in which bounds the (weakly) 1-generic. We show by approximation arguments that some, but not all, 1-generic sets can compute an indifferent set for themselves. We show that all weakly 1-generic sets can compute an indifferent set for themselves. Additional results on indifferent sets, including one of Miller, and two of Fitzgerald, are presented.

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V = HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are continuum many pointwise definable models of ZFC. If there is a transitive model of ZFC, then there are continuum many pointwise definable transitive models of ZFC. What is more, every countable model of ZFC has a class forcing extension that is pointwise definable. Indeed, for the main contribution of this article, every countable model of Gödel-Bernays set theory has a pointwise definable extension, in which every set and class is first-order definable without parameters.

We answer a question of Cummings and Magidor by proving that the P-ideal dichotomy of Todorčević refutes □κ,ω for any uncountable κ. We also show that the P-ideal dichotomy implies the failure of □κ,<b provided that cf(κ) > ω1.

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number κ, let BCκ denote this generalization. Then BCℕ0 is equivalent to the classical Borel conjecture. Assuming the classical Borel conjecture, ¬BCℕ1 is equivalent to the existence of a Kurepa tree of height ℕ1. Using the connection of BCκ with a generalization of Kurepa's Hypothesis, we obtain the following consistency results:

(1) If it is consistent that there is a 1-inaccessible cardinal then it is consistent that BCℕ1.

(2) If it is consistent that BCℕ1, then it is consistent that there is an inaccessible cardinal.

(3) If it is consistent that there is a 1-inaccessible cardinal with ω inaccessible cardinals above it, then ¬BCℕω + (∀n < ω)BCℕn is consistent.

(4) If it is consistent that there is a 2-huge cardinal, then it is consistent that BCℕω

(5) If it is consistent that there is a 3-huge cardinal, then it is consistent that BCκ for a proper class of cardinals κ of countable cofinality.

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory T is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model M of T has an expansion (M, A) by a unary predicate with the finite cover property. We show that every structure has a maximal mutually algebraic reduct. and give a strong structure theorem for the class of elementary extensions of a fixed mutually algebraic structure.

We investigate the question “To what extent can random reals be used as a tool to establish number theoretic facts?” Let 2-RAN be the principle that for every real X there is a real R which is 2-random relative to X. In Section 2, we observe that the arguments of Csima and Mileti [3] can be implemented in the base theory RCA0 and so RCA0 + 2-RAN implies the Rainbow Ramsey Theorem. In Section 3, we show that the Rainbow Ramsey Theorem is not conservative over RCA0 for arithmetic sentences. Thus, from the Csima–Mileti fact that the existence of random reals has infinitary-combinatorial consequences we can conclude that 2-RAN has non-trivial arithmetic consequences. In Section 4, we show that 2-RAN is conservative over RCA0 + BΣ2 for -sentences. Thus, the set of first-order consequences of 2-RAN is strictly stronger than P− + IΣ1 and no stronger than P− + BΣ2.

Every definably complete expansion of an ordered field satisfies an analogue of the Baire Category Theorem.

The implicational fragment of the logic of relevant implication, R→ is known to be decidable. We show that the implicational fragment of the logic of ticket entailment, T→ is decidable. Our proof is based on the consecution calculus that we introduced specifically to solve this 50-year old open problem. We reduce the decidability problem of T→ to the decidability problem of R→. The decidability of T→ is equivalent to the decidability of the inhabitation problem of implicational types by combinators over the base {B, B′, I, W}.

The Axiom of Projective Determinacy implies the existence of a universal set for every n ≥ 1. Assuming there exists a universal set. In ZFC there is a universal set for every α.

We prove that for a finitely generated infinite nilpotent group G with structure (G, ·, …), the connected component G*0 of a sufficiently saturated extension G* of G exists and equals

We construct an expansion of ℤ by a predicate (ℤ, +, P) such that the type-connected component is strictly smaller than ℤ*0. We generalize this to finitely generated virtually solvable groups. As a corollary of our construction we obtain an optimality result for the van der Waerden theorem for finite partitions of groups.

It has been known for six years that the restriction of Girard's polymorphic system F to atomic universal instantiations interprets the full fragment of the intuitionistic propositional calculus. We firstly observe that Tait's method of “convertibility” applies quite naturally to the proof of strong normalization of the restricted Girard system. We then show that each β-reduction step of the full intuitionistic propositional calculus translates into one or more βη-reduction steps in the restricted Girard system. As a consequence, we obtain a novel and perspicuous proof of the strong normalization property for the full intuitionistic propositional calculus. It is noticed that this novel proof bestows a crucial role to η-conversions.

We give results exploring the relationship between dominating and unbounded reals in Hechler extensions, as well as the relationships among the extensions themselves. We show that in the standard Hechler extension there is an unbounded real which is dominated by every dominating real, but that this fails to hold in the tree Hechler extension. We prove a representation theorem for dominating reals in the standard Hechler extension: every dominating real eventually dominates a sandwich composition of the Hechler real with two ground model reals that monotonically converge to infinity. We apply our results to negatively settle a conjecture of Brendle and Löwe (Conjecture 15 of [4]). We also answer a question due to Laflamme.