Related papers: A first-order theory is stable iff its type space …
In a recent article Facchini and Finocchiaro considered a natural pretorsion theory in the category of preordered sets inducing a corresponding stable category. In the present work we propose an alternative construction of the stable…
Four sets of necessary and sufficient conditions are obtained for the first-order rigidity of a periodic bond-node framework \C in R^d which is of crystallographic type. In particular, an extremal rank characterisation is obtained which…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.
The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…
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…
This work is motivated by the following question in data-driven study of dynamical systems: given a dynamical system that is observed via time series of persistence diagrams that encode topological features of solutions snapshots, what…
We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical…
We propose a framework for model-theoretic stability and simplicity in an approximate first-order setting and generalize some classical results.
We extend the notion of stability in the non-abelian category of poset representations (introduced by Futorny and Iusenko) to the category of socle-projective representations of a given $r$-peak poset $\P$. When $\P$ is a poset of type…
This paper introduces the notion of a stability condition on a triangulated category. The motivation comes from the study of Dirichlet branes in string theory, and especially from M.R. Douglas's notion of $\Pi$-stability. From a…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
Let ${\mathcal S}(\R)$ be an o-minimal structure over $\R$, $T \subset \R^{k_1+k_2+\ell}$ a closed definable set, and $$ \displaylines{\pi_1: \R^{k_1+k_2+\ell}\to \R^{k_1 + k_2}, \pi_2: \R^{k_1+k_2+\ell}\to \R^{\ell}, \ \pi_3: \R^{k_1 +…
The space of stability conditions on a triangulated category is naturally partitioned into subsets $U(A)$ of stability conditions with a given heart $A$. If $A$ has finite length and $n$ simple objects then $U(A)$ has a simple geometry,…
Orthogonality in model theory captures the idea of absence of non-trivial interactions between definable sets. We introduce a somewhat opposite notion of cohesiveness, capturing the idea of interaction among all parts of a given definable…
The paper is the second of two and shows 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…
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…
Vietoris-Rips and degree Rips complexes are represented as homotopy types by their underlying posets of simplices, and basic homotopy stability theorems are recast in these terms. These homotopy types are viewed as systems (or functors),…
We prove that any `finite-type' component of a stability space of a triangulated category is contractible. The motivating example of such a component is the stability space of the Calabi--Yau-$N$ category $\mathcal{D}(\Gamma_N Q)$…
Informed by our understanding of the tt-geometry of permutation modules, we investigate the proper definition of the `stable permutation category' of a finite group. Then we prove that this category decomposes over cyclic and generalized…