Related papers: Cofinality quantifiers in Abstract Elementary Clas…

We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…

We prove a refinement of Quillen's Theorem A, providing necessary and sufficient conditions for a functor to be cofinal with respect to diagrams valued in a fixed $\infty$-category. We deduce this from a general duality phenomenon for…

We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment…

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Let K be an abstract elementary class with amalgamation, and Lowenheim Skolem number LS(K). We prove that for a suitable Hanf number chi_0 if chi_0 < lambda_0 <= lambda_1, and K is categorical in lambda^+_1 then it is categorical in…

Sifted colimits (those that commute with finite products in sets) play a major role in categorical universal algebra. For example, varieties of (many-sorted) algebras are precisely the free cocompletions under sifted colimits of…

We provide here the first steps toward Classification Theory of Abstract Elementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categorical in some lambda greater than its Lowenheim-Skolem…

We deal with stability theory for ``reasonable'' non-elementary classes without any remanents of compactness (like: above Hanf number or definable by L_{omega_1, omega}).

We prove that, if $A$ is a positively graded, graded commutative, local, finite Hopf algebra, its cohomology is finitely generated, thus unifying classical results of Wilkerson and Hopkins-Smith, and of Friedlander-Suslin. We do this by…

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…

We exhibit an equivalence between the model-theoretic framework of universal classes and the category-theoretic framework of locally multipresentable categories. We similarly give an equivalence between abstract elementary classes (AECs)…

We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…

We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.

We introduce a cohomology theory for a class of projective varieties over a finite field coming from the canonical trace on a C*-algebra attached to the variety. Using the cohomology, we prove the rationality, functional equation and the…

We introduce notions of lax semiadditive and lax additive $(\infty,2)$-categories, categorifying the classical notions of semiadditive and additive 1-categories. To establish a well-behaved axiomatic framework, we develop a calculus of lax…

One of the major advantages of $\infty$-category theory over classical $1$-category theory is its robust and homotopically meaningful framework for taking (co)limits of diagrams of $\infty$-categories. However, it is both subtle and crucial…

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…

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

We introduce stratified labelings as a novel semantical approach to abstract argumentation frameworks. Compared to standard labelings, stratified labelings provide a more fine-grained assessment of the controversiality of arguments using…