Related papers: Homomorphism Preservation Theorems for Many-Valued…
Homotopy type theory is a modern foundation for mathematics that introduces the univalence axiom and is particularly suitable for the study of homotopical mathematics and its formalization via proof assistants. In order to better comprehend…
In this paper, we introduce a family of topological spaces that captures the existence of preservation theorems. The structure of those spaces allows us to study the relativisation of preservation theorems under suitable definitions of…
The combination of persistent homology and discrete Morse theory has proven very effective in visualizing and analyzing big and heterogeneous data. Indeed, topology provides computable and coarse summaries of data independently from…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
Given a finite dimensional algebra $\Lambda$, we show that a frequently satisfied finiteness condition for the category ${\cal P}^{\infty}(\Lambda\rm{-mod})$ of all finitely generated (left) $\Lambda$-modules of finite projective dimension,…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
In view of the Segal construction each category with a coherent operation gives rise to a cohomology theory. Similarly each open stable differential relation $R$ imposed on smooth maps of manifolds determines cohomology theories $k^*$ and…
We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…
We give sufficient conditions which ensure that a functor of finite length from an additive category to finite-dimensional vector spaces has a projective resolution whose terms are finitely generated. For polynomial functors, we study also…
Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…
We regard the classification of rational homotopy types as a problem in algebraic deformation theory: any space with given cohomology is a perturbation, or deformation, of the "formal" space with that cohomology. The classifying space is…
Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite presentations and resolutions. Centrally at issue…
This note recalls the representation of regular theories T in terms of set-valued functors on models given by Makkai(1990), and explicitly states the representation theorem for the classifying topos Set[T] in terms of filtered colimit…
We prove and explain several classical formulae for homotopy (co)limits in general (combinatorial) model categories which are not necessarily simplicially enriched. Importantly, we prove versions of the Bousfield-Kan formula and the fat…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…
We prove a Model Existence Theorem for a fully infinitary logic for metric structures. This result is based on a generalization of the notions of approximate formulas and approximate truth in normed structures introduced by Henson and…
In this paper we study structural properties of residuated lattices that are idempotent as monoids. We provide descriptions of the totally ordered members of this class and obtain counting theorems for the number of finite algebras in…
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…