Related papers: Classification over a predicate -- the general cas…

For an $\aleph_1$-categorical atomic class, we clarify the space of types over the unique model of size $\aleph_1$. Using these results, we prove that if such a class has a model of size $\beth_1^+$ then it is $\omega$-stable.

We study two partial orders on $[x_1,...,x_n]$, the free abelian monoid on ${x_1,...,x_n}$. These partial orders, which we call the ``strongly stable'' and the ``stable'' partial order, are defined by the property that their filters are…

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…

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

This is a survey, intended both for group theorists and model theorists, concerning the structure of pseudofinite groups, that is, infinite models of the first order theory of finite groups. The focus is on concepts from stability theory…

Representation stability is a theory describing a way in which a sequence of representations of different groups is related, and essentially contains a finite amount of information. Starting with Church-Ellenberg-Farb's theory of…

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate appropriate to such structures. We indicate the utility of this theory as a framework for the development…

This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…

In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned class of first-order theories can be regarded as "not…

We provide a formal introduction into the classic theorems of general topology and its axiomatic foundations in set theory. In this second part we introduce the fundamental concepts of topological spaces, convergence, and continuity, as…

In this paper we introduce the notion of the stability of a sequence of modules over Hecke algebras. We prove that a finitely generated consistent sequence associated with Hecke algebras is representation stable.

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…

As the prototypical category, $\mathbf{Set}$ has many properties which make it special amongst categories. From the point of view of mathematical logic, one such property is that $\mathbf{Set}$ has enough structure to "properly" formalise…

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…

For simple theories with a strong version of amalgamation we obtain the canonical hyperdefinable group from the group configuration. This provides a generalization to simple theories of the group configuration theorem for stable theories.

We propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Sigma_1 level of the…

We prove that the stable category associated with the category $\mathsf{PreOrd}(\mathbb C)$ of internal preorders in a pretopos $\mathbb C$ satisfies a universal property. The canonical functor from $\mathsf{PreOrd}(\mathbb C)$ to the…