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 consider VC-minimal theories admitting unpackable generating families, and show that in such theories, forking of formulae over a model M is equivalent to containment in global types definable over M, generalizing a result of Dolich on o-minimal theories in [4].

Given a sequence {αn} in (0,1) converging to a rational, we examine the model theoretic properties of structures obtained as limits of Shelah-Spencer graphs G(). We show that in most cases the model theory is either extremely well-behaved or extremely wild, and characterize when each occurs.

A notation for an ordinal using patterns of resemblance is based on choosing an isominimal set of ordinals containing the given ordinal. There are many choices for this set meaning that notations are far from unique. We establish that among all such isominimal sets there is one which is smallest under inclusion thus providing an appropriate notion of normal form notation in this context. In addition, we calculate the elements of this isominimal set using standard notations based on collapsing functions. This provides a capstone to the results in [2, 6, 8, 9, 7], using further refinement of ordinal arithmetic developed in [8] which then both allows for a simple characterization of normal forms for patterns of order one and will play a key role in the arithmetical analysis of pure patterns of order two, [5].

Rationals and countable ordinals are important examples of structures with decidable monadic second-order theories. A chain is an expansion of a linear order by monadic predicates. We show that if the monadic second-order theory of a countable chain C is decidable then C has a non-trivial expansion with decidable monadic second-order theory.

In this paper, we propose a weak regularity principle which is similar to both weak König's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then analyze different ways of generalizing this principle.

We show that every two-dimensional class of topological similarity, and hence every diagonal conjugacy class of pairs, is meager in the group of order preserving bijections of the rationale and in the group of automorphisms of the ordered rational Urysohn space.

Let T1, T2 be countable first-order theories, Mi ⊨ Ti and any regular ultrafilter on λ ≥ ℵ0. A longstanding open problem of Keisler asks when T2 is more complex than T1, as measured by the fact that for any such λ, , if the ultrapower realizes all types over sets of size ≤ λ, then so must the ultrapower . In this paper, building on the author's prior work [12] [13] [14], we show that the relative complexity of first-order theories in Keisler's sense is reflected in the relative graph-theoretic complexity of sequences of hypergraphs associated to formulas of the theory. After reviewing prior work on Keisler's order, we present the new construction in the context of ultrapowers, give various applications to the open question of the unstable classification, and investigate the interaction between theories and regularizing sets. We show that there is a minimum unstable theory, a minimum TP2 theory, and that maximality is implied by the density of certain graph edges (between components arising from Szemerédi-regular decompositions) remaining bounded away from 0, 1. We also introduce and discuss flexible ultrafilters, a relevant class of regular ultrafilters which reflect the sensitivity of certain unstable (non low) theories to the sizes of regularizing sets, and prove that any ultrafilter which saturates the minimal TP2 theory is flexible.

We investigate Borel reducibility between equivalence relations E(X; p) = Xℕ/ℓp(X)'s where X is a separable Banach space. We show that this reducibility is related to the so called Hölder(α) embeddability between Banach spaces. By using the notions of type and cotype of Banach spaces, we present many results on reducibility and unreducibility between E(Lr; p)'s and E(c0; p)'s for r, p Є [1, +∞).

We also answer a problem presented by Kanovei in the affirmative by showing that C(ℝ+)/C0(ℝ+) is Borel bireducible to ℝℕ/c0.

We show that strongly compact cardinals and MM are sensitive to λ-closed forcings for arbitrarily large λ. This is done by adding ‘regressive’ λ-Kurepa trees in either case. We argue that the destruction of regressive Kurepa trees requires a non-standard application of MM. As a corollary, we find a consistent example of an ω2-closed poset that is not forcing equivalent to any ω2-directed-closed poset.

We prove that by showing that for any set C not of PA-degree and any set A, there exists an infinite subset G of A or such that G ⊕ C is also not of PA-degree.

Let κ be an infinite cardinal. A subset of (κκ)n is a -subset if it is the projection p[T] of all cofinal branches through a subtree T of (>κκ)n+1 of height κ. We define and -subsets of (κκ)n as usual.

Given an uncountable regular cardinal κ with κ = κ<κ and an arbitrary subset A of κκ, we show that there is a <κ-closed forcing ℙ that satisfies the κ+-chain condition and forces A to be a -subset of κκ in every ℙ-generic extension of V. We give some applications of this result and the methods used in its proof.

(i) Given any set x, we produce a partial order with the above properties that forces x to be an element of L.

(ii) We show that there is a partial order with the above properties forcing the existence of a well-ordering of κκ whose graph is a -subset of κκ × κκ.

(iii) We provide a short proof of a result due to Mekler and Väänänen by using the above forcing to add a tree T of cardinality and height κ such that T has no cofinal branches and every tree from the ground model of cardinality and height κ without a cofinal branch quasi-order embeds into T.

(iv) We will show that generic absoluteness for -formulae (i.e., formulae with parameters which define -subsets of κκ) under <κ-closed forcings that satisfy the κ+-chain condition is inconsistent.

In another direction, we use methods from the proofs of the above results to show that - and -subsets have some useful structural properties in certain ZFC-models.

In this paper we describe the well-founded initial segment of the free Heyting algebra α on finitely many, α, generators. We give a complete classification of initial sublattices of 2 isomorphic to 1 (called ‘low ladders’), and prove that for 2 ≤ α < ω, the height of the well-founded initial segment of α is ω2.

We show that the variety of weakly representable relation algebras is neither canonical nor closed under Monk completions.

We prove that each ω-categorical, generically stable group is solvable-by-finite.

We introduce a very weak language on p-adic fields K, which is just rich enough to have exactly the same definable subsets of the line K that one has using the ring language. (In our context, definable always means definable with parameters.) We prove that the only definable functions in the language are trivial functions. We also give a definitional expansion of in which K has quantifier elimination, and we obtain a cell decomposition result for -definable sets.

Our language can serve as a p-adic analogue of the very weak language (<) on the real numbers, to define a notion of minimality on the field of p-adic numbers and on related valued fields. These fields are not necessarily Henselian and may have positive characteristic.

This work builds on previous papers by Hrushovski, Pillay and the author where Keisler measures over NIP theories are studied. We discuss two constructions for obtaining generically stable measures in this context. First, we show how to symmetrize an arbitrary invariant measure to obtain a generically stable one from it. Next, we show that suitable sigma-additive probability measures give rise to generically stable Keisler measures. Also included is a proof that generically stable measures over o-minimal theories and the p-adics are smooth.

We introduce the Hausdorff measure for definable sets in an o-minimal structure, and prove the Cauchy–Crofton and co-area formulae for the o-minimal Hausdorff measure. We also prove that every definable set can be partitioned into “basic rectifiable sets”, and that the Whitney arc property holds for basic rectifiable sets.

We construct a Galois connection between closure and interior operators on a given set. All arguments are intuitionistically valid. Our construction is an intuitionistic version of the classical correspondence between closure and interior operators via complement.