Related papers: A first-order theory is stable iff its type space …
We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple…
We prove that any type in an NIP theory can be decomposed into a stable part (a generically stable partial type) and a distal-like quotient.
Stability is a well investigated concept in extremal combinatorics. The main idea is that if some object is close in size to an extremal object, then it retains the structure of the extremal construction. In the present paper we study…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
In this paper we study topological properties of stable Hamiltonian structures. In particular, we prove the following results in dimension three: The space of stable Hamiltonian structures modulo homotopy is discrete; there exist stable…
Classification of homotopy n-types has focused on developing algebraic categories which are equivalent to categories of n-types. We expand this theory by providing algebraic models of homotopy-theoretic constructions for stable one-types.…
Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…
We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary. We define the…
Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…
We study the properties of topological spaces $(X,\tau)$, where $X$ is a definable set in an o-minimal structure and the topology $\tau$ on $X$ has a basis that is (uniformly) definable. Examples of such spaces include the canonical…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
In this article we introduce the space of configurations of commuting elements in a topological group and show that it satisfies rational homological stability for the sequences of unitary, special unitary and symplectic groups. We also…
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…
We study the collection of first-order logical schemata all of whose instances are theorems of a given theory $T$; we call these the validities of $T$ ($\mathsf{V}(T)$). It is easy to see that if $T$ is a decidable theory, then…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
We give a classification of the $p$--local stable homotopy type of $BG$, where $G$ is a finite group, in purely algebraic terms. $BG$ is determined by conjugacy classes of homomorphisms from $p$--groups into $G$. This classification greatly…
In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…
The isotropic harmonic oscillator in N dimensions is shown to have an underlying symmetry group O(2,1)X O(N)which implies a unique result for the energy spectrum of the system. Raising and lowering operators analogous to those of the…
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…
We show a stability-type theorem for foliations on projective spaces which arise as pullbacks of foliations with a split tangent sheaf on weighted projective spaces. As a consequence, we will be able to construct many irreducible components…