Related papers: A first-order theory is stable iff its type space …

In this paper we study the global structure of the stable homotopy theory of spectra. We establish criteria for when the homotopy theory associated to a given stable model category agrees with the classical stable homotopy theory of…

We discuss the two closely related, but different concepts of weak and almost weak stability for the powers of a contraction on a separable Hilbert space. Extending Halmos' and Rohlin's theorems in ergodic theory as a model, we show that…

Using algebraic geometry methods, the third author proved that the group ring of a surjunctive group with coefficients in a field is always stably finite. In other words, every group satisfying Gottschalk's conjecture also satisfies…

In this article, we present the stable category of preordered groups associated with some Z-pretorsion theory. We first define such a category as well as the related functor, and then study their properties. By doing so, we provide a…

We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

In a series of papers starting in [Sel01] and culminating in [Sel07], Z. Sela proved that free groups, and more generally torsion-free hyperbolic groups, have a stable first-order theory. The question of the stability of the free product of…

Let $\mathrm{h}\mathscr{C}$ be the homotopy category of a stable infinity category $\mathscr{C}$. Then the homotopy category $\mathrm{h}\mathscr{C}^{\Delta^{1}}$ of morphisms in the stable infinity category $\mathscr{C}$ is also…

We consider an arbitrary topological group $G$ definable in a structure $\mathcal M$, such that some basis for the topology of $G$ consists of sets definable in $\mathcal M$. To each such group $G$ we associate a compact $G$-space of…

We introduce and study adhesive spaces. Using this concept we obtain a characterization of stable Baire maps $f:X\to Y$ of the class $\alpha$ for wide classes of topological spaces. In particular, we prove that for a topological space $X$…

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

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…

Let $\cal R$ be an ordered vector space over an ordered division ring. We prove that every definable set $X$ is a finite union of relatively open definable subsets which are definably simply-connected, settling a conjecture from [5]. The…

A first-order structure $\mathfrak{A}$ is called monadically stable iff every expansion of $\mathfrak{A}$ by unary predicates is stable. In this article we give a classification of the class $\mathcal{M}$ of $\omega$-categorical monadically…

This paper is an expository account of the theory of stable infinity categories. We prove that the homotopy category of a stable infinity category is triangulated, and that the collection of stable infinity categories is closed under a…

Stable homotopy theory is governed by the principle that after inverting loop spaces, homotopy types become the representing objects for homology theories. We show that this principle extends to higher category theory: inverting…

The notion of a natural model of type theory is defined in terms of that of a representable natural transfomation of presheaves. It is shown that such models agree exactly with the concept of a category with families in the sense of Dybjer,…

Geometrical stability theory is a powerful set of model-theoretic tools that can lead to structural results on models of a simple first-order theory. Typical results offer a characterization of the groups definable in a model of the theory.…

A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…

The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…