Related papers: A model theoretic Baire category theorem for simpl…
We characterize those finite groups for which the bounded derived category of finite dimensional representations over an algebraically closed field of characteristic $p$ has distributive lattice of thick subcategories: they are precisely…
We prove in this text a characterization of the possible entropy dimensions of minimal tridimensional subshifts of finite type with a computability condition, using Goldbach's theorem on Fermat numbers.
Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…
We show how one may establish proof-theoretic results for constructive Zermelo-Fraenkel set theory, such as the compactness rule for Cantor space and the Bar Induction rule for Baire space, by constructing sheaf models and using their…
We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
We prove that if $T$ is an $\omega$-categorical supersimple theory with nontrivial dependence (given by forking), then there is a nontrivial regular 1-type over a finite set of reals which is realized by real elements; hence forking induces…
In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…
We apply the work of Bourgain, Fremlin and Talagrand on compact subsets of the first Baire class to show new results about phi-types for phi NIP. In particular, we show that if M is a countable model, then an M-invariant phi-type is Borel…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…
We extend the methods used by V. Ferenczi and Ch. Rosendal to obtain the `third dichotomy' in the program of classification of Banach spaces up to subspaces, in order to prove that a Banach space E with an admissible system of blocks with…
Amplitudes in open topological string theory may be described completely by certain A-infinity-categories. We detail a general construction of all cyclic minimal models for a given A-infinity-algebra and apply this result to the case of N=2…
We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…
This paper introduces the notion of extriangulated length categories, whose prototypical examples include abelian length categories and bounded derived categories of finite dimensional algebras with finite global dimension. We prove that an…
Many economic theory models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. We provide a principled framework for scaling results from such models by removing these finiteness…
This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…
In this paper, we prove the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.
We prove a dichotomy for $D$-rank 1 types in simple theories that generalizes Buechler's dichotomy for $D$-rank 1 minimal types in stable theories: every $D$-rank 1 type is either 1-based or part of its algebraic closure, defined by a…
We discuss a systematic procedure for categorifying presentable six-functor formalisms. Our main result produces, given the input of a representation of the $\infty$-category of correspondences of an $\infty$-category with finite limits…