Related papers: The Kim-Pillay theorem for Abstract Elementary Cat…
This paper continues the study of superstability in abstract elementary classes (AECs) satisfying the amalgamation property. In particular, we consider the definition of $\mu$-superstability which is based on the local character…
We prove a version of a small index property theorem for strong amalgamation classes. Our result builds on an earlier theorem by Lascar and Shelah (in their case, for saturated models of uncountable first-order theories). We then study…
We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…
We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…
Canonical extension has proven to be a powerful tool in algebraic study of propositional logics. In this paper we describe a generalization of the theory of canonical extension to the setting of first order logic. We define a notion of…
Kleene algebras with tests (KATs) offer sound, complete, and decidable equational reasoning about regularly structured programs. Interest in KATs has increased greatly since NetKAT demonstrated how well extensions of KATs with…
This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…
We present the notions of positively complete theory and general forms of amalgamation in the framework of positive logic. We explore the fundamental properties of positively complete theories and study the behaviour of companion theories…
We present a categorical framework for formal systems in which inference rules with $m$ metavariables over a category of syntax $\mathscr{S}$, taken to be a cartesian PROP, are represented by operations of arity $k \to n$ equipped with…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We use the framework of Abstract Elementary Classes ($\mathrm{AEC}$s) to introduce a new Construction Principle $\mathrm{CP}(\mathbf{K},\ast)$, which generalises the Construction Principle of Eklof, Mekler and Shelah and allows for many…
In the 1970s Alain Connes identified the appropriate notion of amenabilty for von Neumann algebras, and used it to obtain a deep internal finite dimensional approximation structure for these algebras. This structure is exactly what is…
$\mu$-Abstract Elementary Classes are a model theoretic framework introduced in [BGL+16] to encompass classes axiomatized by $\mathbb{L}_{\infty, \infty}$. We show that the framework extends beyond these logics by showing classes…
We introduce prime products as a generalization of ultraproducts for positive logic. Prime products are shown to satisfy a version of {\L}o\'s's Theorem restricted to positive formulas, as well as the following variant of Keisler…
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 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…
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…
We prove the uniqueness of high cofinality limit models in stable abstract elementary classes (AECs) with amalgamation, assuming the existence of a rather weak independence relation. $\textbf{Theorem.}$ Suppose $\mathbf{K}$ is a…
We show how to build primes models in classes of saturated models of abstract elementary classes (AECs) having a well-behaved independence relation: $\mathbf{Theorem.}$ Let $K$ be an almost fully good AEC that is categorical in $\text{LS}…