Related papers: Linear orders in NIP structures
We show that a large class of divisible abelian $\ell$-groups (lattice ordered groups) of continuous functions is interpretable (in a certain sense) in the lattice of the zero sets of these functions. This has various applications to the…
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data…
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
This work can be thought as a contribution to the model theory of group extensions. We study the groups G which are interpretable in the disjoint union of two structures (seen as a two-sorted structure). We show that if one of the two…
Let omega be the first infinite ordinal (or the set of all natural numbers) with the usual order <. In section 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of omega, whose cardinality is…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…
Linearisability is a central notion for verifying concurrent libraries: a given library is proven safe if its operational history can be rearranged into a new sequential one which, in addition, satisfies a given specification.…
We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…
We study the program complexity of datalog on both finite and infinite linear orders. Our main result states that on all linear orders with at least two elements, the nonemptiness problem for datalog is EXPTIME-complete. While containment…
In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…
We develop some model theory of multi-linear forms, generalizing Granger in the bi-linear case. In particular, after proving a quantifier elimination result, we show that for an NIP field K, the theory of infinite dimensional non-degenerate…
We show that for any type in Martin-L\"of Intensional Type Theory, the terms of that type and its higher identity types form a weak omega-category in the sense of Leinster. Precisely, we construct a contractible globular operad of definable…
Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms. For any fixed prime divisor $p$ of $|G|$, we provide a complete characterization of the structure of a group $G$ in which every maximal $A$-invariant…
We explore \emph{semibounded} expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We introduce the notion of a \emph{semibounded} expansion of an arbitrary ordered group, extending…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
We study semantic and syntactic properties of spherical orders and their elementary theories, including finite and dense orders and their theories. It is shown that theories of dense $n$-spherical orders are countably categorical and…
We prove the following well known conjecture: let $\Sigma$ be an oriented surface of finite type whose fundamental group is a nonabelian free group. Let $\phi \in \textup{Mod}(\Sigma)$ be a an infinite order mapping class. Then there exists…