Related papers: Preservation theorems on sparse classes revisited
We describe a construction that to each algebraically specified notion of higher-dimensional category associates a notion of homomorphism which preserves the categorical structure only up to weakly invertible higher cells. The construction…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
The classifying topos of a geometric theory is a topos such that geometric morphisms into it correspond to models of that theory. We study classifying toposes for different infinitary logics: first-order, sub-first-order (i.e. geometric…
In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…
Neural networks adapt through first-order parameter updates, yet it remains unclear whether such updates preserve logical coherence. We investigate the geometric limits of the Linear Propagation Assumption (LPA), the premise that local…
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…
We study when algebra endomorphisms can be lifted to first-order flat lifts. To a first-order flat lift of an algebra and an endomorphism, we associate a canonical class in Hochschild cohomology with coefficients in a naturally twisted…
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…
Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…
Recently, a number of variants of the notion of cut-preserving hypergraph sparsification have been studied in the literature. These variants include directed hypergraph sparsification, submodular hypergraph sparsification, general notions…
We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…
We consider hereditary classes of graphs equipped with a total order. We provide multiple equivalent characterisations of those classes which have bounded twin-width. In particular, we prove a grid theorem for classes of ordered graphs…
We prove that $p $-harmonic systems with antisymmetric potentials can be written in divergence form as a conservation law. This extends to the $p$-harmonic framework the original work from 2006 of the second author for $p=2$…
We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Marde\v{s}i\'{c} and Prasolov…
The elimination distance to some target graph property P is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic. We…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
Riehl and Verity have established that for a quasi-category $A$ that admits limits, and a homotopy coherent monad on $A$ which does not preserve limits, the Eilenberg-Moore object still admits limits; this can be interpreted as a…
We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We…