Related papers: Stable amalgamation over a predicate and the Gaifm…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…
We show that in a stable first-order theory, the failure of higher-dimensional type amalgamation can always be witnessed by algebraic structures which we call n-ary polygroupoids. This generalizes a result of Hrushovski that failures of…
We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…
We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…
Let T be a complete first order theory in a countable relational language L . We assume relation symbols have been added to make each formula equivalent to a predicate. Adjoin a new unary function symbol sigma to obtain the language…
A successor-invariant first-order formula is a formula that has access to an auxiliary successor relation on a structure's universe, but the model relation is independent of the particular interpretation of this relation. It is well known…
We introduce tame abstract elementary classes as a generalization of all cases of abstract elementary classes that are known to permit development of stability-like theory. In this paper we explore stability results in this context. We…
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…
We study the notions generic stability, regularity, homogeneous pregeometries, quasiminimality, and their mutual relations, in an arbitrary first order theory T. We prove that "infinite-dimensional homogeneous pregeometries" coincide with…
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…
We prove two results about generically stable types $p$ in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on stably dominated types. The second is an…
We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…
Let $G$ be a multiplicative subgroup of $\mathbb{Q}_p$. In this paper, we describe the theory of the pair $(\mathbb{Q}_p, G)$ under the condition that $G$ satisfies Mann property and is small as subset of a first-order structure. First, we…
We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…
The aim of this paper is to generalise the notion of p-stability to fusion systems. We study the question how Qd(p) is involved in finite simple groups. We show that with a single exception a simple group involving Qd(p) has a subgroup…
We study the consistency and consistency strength of various configurations concerning the cardinal characteristics $\mathfrak{s}_\theta,\mathfrak{p}_\theta,\mathfrak{g}_\theta,\mathfrak{r}_\theta,\mathfrak{t}_\theta$ at uncountable regular…
Let $N$ be a normal subgroup of a group $G$. An $N$-module $Q$ is $G$-stable provided that $Q$ is equivalent to the twist $Q^g$ of $Q$ by $g$, for every $g\in G$. If the action of $N$ on $Q$ extends to an action of $G$ on $Q$, $Q$ is…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
We study the relation (and differences) between stability and Property (S) in the simple and stably finite framework. This leads us to characterize stable elements in terms of its support, and study these concepts from different sides :…