Related papers: Disjoint $n$-amalgamation and pseudofinite countab…
A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…
Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…
A trivial automorphism of the Boolean algebra $\mathcal P(\mathbb N) / \mathrm{Fin}$ is an automorphism induced by the action of some function $\mathbb N \rightarrow \mathbb N$. In models of forcing axioms all automorphisms are trivial, and…
We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…
We prove that there exists a constant $c_0$ such that for any $t \in \mathbb{N}$ and any $n\geq c_0 t$, if $A \subset S_n$ is a $t$-intersecting family of permutations then$|A|\leq (n-t)!$. Furthermore, if $|A|\ge 0.75(n-t)!$ then there…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…
Connections between structural graph theory and finite model theory recently gained a lot of attention. In this setting, many interesting questions remain on the properties of dependent (NIP) hereditary classes of graphs, in particular…
The main purpose of this article is to introduce a comprehensive, unified theory of the geometry of all connections. We show that one can study a connection via a certain, closely associated second-order differential equation. One of the…
The generalised colouring numbers $\mathrm{adm}_r(G)$, $\mathrm{col}_r(G)$, and $\mathrm{wcol}_r(G)$ were introduced by Kierstead and Yang as generalisations of the usual colouring number, also known as the degeneracy of a graph, and have…
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e. classes of finite algebras closed under finite products,…
An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…
Let $T$ be a first-order theory. A correspondence is established between internal covers of models of $T$ and definable groupoids within $T$. We also consider amalgamations of independent diagrams of algebraically closed substructures, and…
The topological Tverberg theorem claims that for any continuous map of the (q-1)(d+1)-simplex to R^d there are q disjoint faces such that their images have a non-empty intersection. This has been proved for affine maps, and if $q$ is a…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
We examine N=1 supersymmetric gauge theories which confine in the presence of a tree-level superpotential. We show the confining spectra which satisfy the 't Hooft anomaly matching conditions and give a simple method to find the confining…
By using the relative derived categories, we prove that if an Artin algebra $A$ has a module $T$ with ${\rm inj.dim}T<\infty$ such that $^\perp T$ is finite, then the bounded derived category $D^b(A\mbox{-}{\rm mod})$ admits a categorical…
The notion of an open collar is generalized to that of a pseudo-collar. Important properties and examples are discussed. The main result gives conditions which guarantee the existence of a pseudo-collar structure on the end of an open…
We give an example of two ordered structures M, N in the same language L with the same universe, the same order and admitting the same one-variable definable subsets such that M is a model of the common theory of o-minimal L-structures and…
For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…