Related papers: On sets with rank one in simple homogeneous struct…

Let $V$ be a finite relational vocabulary in which no symbol has arity greater than 2. Let $M$ be countable $V$-structure which is homogeneous, simple and 1-based. The first main result says that if $M$ is, in addition, primitive, then it…

Suppose that M is an infinite structure with finite relational vocabulary such that every relation symbol has arity at most 2. If M is simple and homogeneous then its complete theory is supersimple with finite SU-rank which cannot exceed…

Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…

Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…

Given a relational structure M on n elements, let D(M) be the minimum quantifier rank of a first order formula identifying M up to isomorphism in the class of n-element structures. The obvious upper bound is D(M)\le n. We show that if the…

We prove that if $T$ is an $\omega$-categorical supersimple theory with nontrivial dependence (given by forking), then there is a nontrivial regular 1-type over a finite set of reals which is realized by real elements; hence forking induces…

We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…

We describe all binary simple homogeneous structures M in terms of 0-definable equivalence relations on M, which "coordinatize" M and control dividing, and extension properties that respect these equivalence relations.

Let $X/\mathbb{F}_{q}$ be a smooth, geometrically connected, quasiprojective variety. Let $\mathcal{E}$ be a semisimple overconvergent $F$-isocrystal on $X$. Suppose that irreducible summands $\mathcal{E}_i$ of $\mathcal E$ have rank 2,…

Let (L;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C), i.e., the structures with domain L that are first-order definable in (L;C). We show that up…

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

In this article we give a classification of the binary, simple, $\omega$-categorical structures with SU-rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that…

A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the…

We work with a finite relational vocabulary with at least one relation symbol with arity at least 2. Fix any integer $m > 1$. For almost all finite structures (labelled or unlabelled) such that at least $m$ elements are moved by some…

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

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…

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…