We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections between independence in database theory and stochastic independence. As indeed, in light of the aforementioned reduction and recent work of Ben-Yaacov :957–1012, 2013), the former case of independence can be seen as the discrete version of the latter.

We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories (those where, in a precise sense, the cellular morphisms are generated by a set) are exactly those that give rise to stable independence notions. We give two applications: on the one hand, we show that the abstract elementary classes of roots of Ext studied by Baldwin–Eklof–Trlifaj are stable (...) and tame. On the other hand, we give a simpler proof (in a special case) that combinatorial categories are closed under 2-limits, a theorem of Makkai and Rosický. (shrink)

We present a way of topologizing sets of Galois types over structures in abstract elementary classes with amalgamation. In the elementary case, the topologies thus produced refine the syntactic topologies familiar from first order logic. We exhibit a number of natural correspondences between the model-theoretic properties of classes and their constituent models and the topological properties of the associated spaces. Tameness of Galois types, in particular, emerges as a topological separation principle. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

We study Lascar strong types and Galois types and especially their relation to notions of type which have finite character. We define a notion of a strong type with finite character, the so-called Lascar type. We show that this notion is stronger than Galois type over countable sets in simple and superstable finitary AECs. Furthermore, we give an example where the Galois type itself does not have finite character in such a class.

We study Martsinkovsky–Russell torsion modules with pure embeddings as an abstract elementary class. We give a model-theoretic characterization of the pure-injective and the Σ-pure-injective modules relative to the class of torsion modules assuming that the torsion submodule is a pure submodule. Our characterization of relative Σ-pure-injective modules extends the classical characterization of Gruson and Jenson as well as Zimmermann. We study the limit models of the class and determine when the class is superstable assuming that the torsion submodule is a (...) pure submodule. As a corollary, we show that the class of torsion abelian groups with pure embeddings is strictly stable (i.e., stable not superstable). (shrink)

The cofinality quantifiers were introduced by Shelah as an example of a compact logic stronger than first-order logic. We show that the classes of models axiomatized by these quantifiers can be turned into an Abstract Elementary Class by restricting to positive and deliberate uses. Rather than using an ad hoc proof, we give a general framework of abstract Skolemizations. This method gives a uniform proof that a wide rang of classes are Abstract Elementary Classes.

We show that certain classes of modules have universal models with respect to pure embeddings: Let R be a ring, T a first‐order theory with an infinite model extending the theory of R‐modules and (where ⩽pp stands for “pure submodule”). Assume has the joint embedding and amalgamation properties. If or, then has a universal model of cardinality λ. As a special case, we get a recent result of Shelah [28, 1.2] concerning the existence of universal reduced torsion‐free abelian groups with (...) respect to pure embeddings.We begin the study of limit models for classes of R‐modules with joint embedding and amalgamation. We show that limit models with chains of long cofinality are pure‐injective and we characterize limit models with chains of countable cofinality. This can be used to answer [18, Question 4.25].As this paper is aimed at model theorists and algebraists an effort was made to provide the background for both. (shrink)