Using square sequences, a stationary subset ST of אω1+1 is constructed from a tree T of height ω1, uniformly in T. Under suitable hypotheses, adding a closed unbounded subset to ST requires adding a cofinal branch to T or collapsing at least one of ω1, אω1, and אω1+1. An application is that in ZFC there is no parameter free definition of the family of subsets of אω1+1 that have a closed unbounded subset in some ω1, אω1, and אω1+1 preserving outer model.

We show in ZFC that if there is no proper class inner model with a Woodin cardinal, then there is an absolutely definable core model that is close to V in various ways.

Working under AD, we investigate the length of prewellorderings given by the iterates of ℳ2k+1, which is the minimal proper class mouse with 2k + 1 many Woodin cardinals. In particular, we answer some questions from [4] (the discussion of the questions appears in the last section of [2]).

We show that there are plenty of infinite sets that satisfy the omniscience principle, in a minimalistic setting for constructive mathematics that is compatible with classical mathematics. A first example of an omniscient set is the one-point compactification of the natural numbers, also known as the generic convergent sequence. We relate this to Grilliot's and Ishihara's Tricks. We generalize this example to many infinite subsets of the Cantor space. These subsets turn out to be ordinals in a constructive sense, with respect to the lexicographic order, satisfying both a well-foundedness condition with respect to decidable subsets, and transfinite induction restricted to decidable predicates. The use of simple types allows us to reach any ordinal below εQ, and richer type systems allow us to get higher.

We develop a version of Namba forcing which is useful for constructing models with no good scale on ℵω. A model is produced in which holds for all finite n ≥ 1, but there is no good scale on ℵω; this strengthens a theorem of Cummings, Foreman, and Magidor [3] on the non-compactness of square.

Shelah-Woodin [10] investigate the possibility of violating instances of GCH through the addition of a single real. In particular they show that it is possible to obtain a failure of CH by adding a single real to a model of GCH, preserving cofinalities. In this article we strengthen their result by showing that it is possible to violate GCH at all infinite cardinals by adding a single real to a model of GCH. Our assumption is the existence of an H(κ+3)-strong cardinal; by work of Gitik and Mitchell [6] it is known that more than an H(κ++)-strong cardinal is required.

We prove that RCA0 + RRT ⊬ ACA0 where RRT is the Rainbow Ramsey Theorem for 2-bounded colorings of triples. This reverse mathematical result is based on a cone avoidance theorem, that every 2-bounded coloring of pairs admits a cone-avoiding infinite rainbow, regardless of the complexity of the given coloring. We also apply the proof of the cone avoidance theorem to the question whether RCA0 + RRT ⊦ ACA0 and obtain some partial answer.

We show a model construction for a system of higher-order illative combinatory logic thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order intuitionistic predicate logic with second-order propositional quantifiers into the system of Barendregt, Bunder and Dekkers, which gives a partial answer to a question posed by these authors.

BD-N is a weak principle of constructive analysis. Several interesting principles implied by BD-N have already been identified, namely the closure of the anti-Specker spaces under product, the Riemann Permutation Theorem, and the Cauchyness of all partially Cauchy sequences. Here these are shown to be strictly weaker than BD-N, yet not provable in set theory alone under constructive logic.

The half-open real unit interval (0,1] is closed under the ordinary multiplication and its residuum. The corresponding infinite-valued propositional logic has as its equivalent algebraic semantics the equational class of cancellative hoops. Fixing a strong unit in a cancellative hoop—equivalently, in the enveloping lattice-ordered abelian group—amounts to fixing a gauge scale for falsity. In this paper we show that any strong unit in a finitely presented cancellative hoop H induces naturally (i.e., in a representation-independent way) an automorphism-invariant positive normalized linear functional on H. Since H is representable as a uniformly dense set of continuous functions on its maximal spectrum, such functionals—in this context usually called states—amount to automorphism-invariant finite Borel measures on the spectrum. Different choices for the unit may be algebraically unrelated (e.g., they may lie in different orbits under the automorphism group of H), but our second main result shows that the corresponding measures are always absolutely continuous w.r.t. each other, and provides an explicit expression for the reciprocal density.

For integers l ≥ 1, d ≥ 0 we study (undirected) graphs with vertices 1, …, n such that the vertices can be partitioned into l parts such that every vertex has at most d neighbours in its own part. The set of all such graphs is denoted Pn (l, d). We prove a labelled first-order limit law, i.e., for every first-order sentence φ, the proportion of graphs in Pn (l, d) that satisfy φ converges as n → ∞. By combining this result with a result of Hundack, Prömel and Steger [12] we also prove that if 1 ≤ s1 ≤ … ≤ sl are integers, then Forb() has a labelled first-order limit law, where Forb() denotes the set of all graphs with vertices 1, …, n, for some n, in which there is no subgraph isomorphic to the complete (l + 1 )-partite graph with parts of sizes 1, s1, …, sl. In the course of doing this we also prove that there exists a first-order formula ξ, depending only on l and d, such that the proportion of ∈ Pn (l, d) with the following property approaches 1 as n → ∞: there is a unique partition of {1, …, n} into l parts such that every vertex has at most d neighbours in its own part, and this partition, viewed as an equivalence relation, is defined by ξ.

This paper shows that the interpolation theorem fails in the intuitionistic logic of constant domains. This result refutes two previously published claims that the interpolation property holds.

We compare the strength of polychromatic and monochromatic Ramsey theory in several set-theoretic domains. We show that the rainbow Ramsey theorem does not follow from ZF, nor does the rainbow Ramsey theorem imply Ramsey's theorem over ZF. Extending the classical result of Erdős and Rado we show that the axiom of choice precludes the natural infinite exponent partition relations for polychromatic Ramsey theory. We introduce rainbow Ramsey ultrafilters, a polychromatic analogue of the usual Ramsey ultrafilters. We investigate the relationship of rainbow Ramsey ultrafilters with various special classes of ultrafilters, showing for example that every rainbow Ramsey ultrafilter is nowhere dense but rainbow Ramsey ultrafilters need not be rapid. This entails comparison of the polychromatic and monochromatic Ramsey theorems as combinatorial principles on ω.

We answer some questions from [4] by giving suitable examples of small Polish structures. First, we present a class of small Polish group structures without generic elements. Next, we construct a first example of a small non-zero-dimensional Polish G-group.

We prove that every diagonally noncomputable function computes a set A which is bi-immune, meaning that neither A nor its complement has an infinite computably enumerable subset.

We answer a question of Garcia-Ferreira and Hrušák by consistently constructing a MAD family maximal in the Katětov order. We also answer several questions of Garcia-Ferreira.

In this note, we show that the theory of tracial von Neumann algebras does not have a model companion. This will follow from the fact that the theory of any locally universal, McDuff II1 factor does not have quantifier elimination. We also show how a positive solution to the Connes Embedding Problem implies that there can be no model-complete theory of II1 factors.

We study low level nondefinability in the Turing degrees. We prove a variety of results, including, for example, that being array nonrecursive is not definable by a Σ1 or Π1 formula in the language (≤, REA) where REA stands for the “r.e. in and above” predicate. In contrast, this property is definable by a Π2 formula in this language. We also show that the Σ1-theory of (, ≤, REA) is decidable.