The classical homomorphism preservation theorem, due to {\L}o\'s, Lyndon and Tarski, states that a first-order sentence $\phi$ is preserved under homomorphisms between structures if, and only if, it is equivalent to an existential positive sentence $\psi$. Given a notion of (syntactic) complexity of sentences, an "equi-resource" homomorphism preservation theorem improves on the classical result by ensuring that $\psi$ can be chosen so that its complexity does not exceed that of $\phi$. We describe an axiomatic approach to equi-resource homomorphism preservation theorems based on the notion of arboreal category. This framework is then employed to establish novel homomorphism preservation results, and improve on known ones, for various logi...
International audienceDecidability of regularity preservation by a homomorphism is a well known open...
We investigate several variants of the homomorphism problem: given two relational structures, is the...
We define a class of invariants, which we call homological invariants, for persistence modules over ...
Previous work of the author [Rossmann\u2708] showed that the Homomorphism Preservation Theorem of cl...
We define Quillen model structures on a family of presheaf toposes arising from tree unravellings of...
In this paper, we give an overview of some recent work on applying tools fromcategory theory in fini...
We present new parameterized preservation properties that provide for each natural number k, semanti...
Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if,...
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequen...
We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the...
Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms t...
Introduced independently by Grothendieck and Heller in the 1980s, derivators provide a formal way to...
We develop a new method in the computation of equivariant homology, which is based on the splitting ...
We prove an algebraic preservation theorem for positive Horn definability in aleph-zero categorical ...
We look at various preservation theorems of classical logic (first of all, / Los - Tarski theorem) w...
International audienceDecidability of regularity preservation by a homomorphism is a well known open...
We investigate several variants of the homomorphism problem: given two relational structures, is the...
We define a class of invariants, which we call homological invariants, for persistence modules over ...
Previous work of the author [Rossmann\u2708] showed that the Homomorphism Preservation Theorem of cl...
We define Quillen model structures on a family of presheaf toposes arising from tree unravellings of...
In this paper, we give an overview of some recent work on applying tools fromcategory theory in fini...
We present new parameterized preservation properties that provide for each natural number k, semanti...
Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if,...
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequen...
We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the...
Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms t...
Introduced independently by Grothendieck and Heller in the 1980s, derivators provide a formal way to...
We develop a new method in the computation of equivariant homology, which is based on the splitting ...
We prove an algebraic preservation theorem for positive Horn definability in aleph-zero categorical ...
We look at various preservation theorems of classical logic (first of all, / Los - Tarski theorem) w...
International audienceDecidability of regularity preservation by a homomorphism is a well known open...
We investigate several variants of the homomorphism problem: given two relational structures, is the...
We define a class of invariants, which we call homological invariants, for persistence modules over ...