Related papers: The Pebble-Relation Comonad in Finite Model Theory

Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…

A equivalence relation, preserving the Chern-Weil form, is defined between connections on a complex vector bundle. Bundles equipped with such an equivalence class are called Structured Bundles, and their isomorphism classes form an abelian…

Goodwillie's rational isomorphism between relative algebraic K-theory and relative cyclic homology, together with the lambda decomposition of cyclic homology, illustrates the close relationships among algebraic K-theory, cyclic homology,…

This paper is part of the general project of proof mining, developed by Kohlenbach. By "proof mining" we mean the logical analysis of mathematical proofs with the aim of extracting new numerically relevant information hidden in the proofs.…

Let K be a comonad on a model category M. We provide conditions under which the associated category of K-coalgebras admits a model category structure such that the forgetful functor to M creates both cofibrations and weak equivalences. We…

Pseudo equality algebras were initially introduced by Jenei and $\rm K\acute{o}r\acute{o}di$ as a possible algebraic semantic for fuzzy type theory, and they have been revised by Dvure\v{c}enskij and Zahiri under the name of JK-algebras. In…

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Let $K_d$ denote the class of all finite graphs and, for graphs $A\subseteq B$, say $A \leq_d B$ if distances in $A$ are preserved in $B$; i.e. for $a, a' \in A$ the length of the shortest path in $A$ from $a$ to $a'$ is the same as the…

We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…

We consider an application of the mathematical formalism of quantum mechanics (QM) outside physics, namely, to game theory. We present a simple game between macroscopic players, say Alice and Bob (or in a more complex form - Alice, Bob and…

The framework of graded semantics uses graded monads to capture behavioural equivalences of varying granularity, for example as found on the linear-time/branching-time spectrum, over general system types. We describe a generic…

A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We…

We consider from a geometric point of view the conjectural fundamental lemma of Langlands and Shelstad for unitary groups over a local field of positive characteristic. We introduce projective algebraic varieties over the finite residue…

We consider certain generalizations of gentle algebras that we call semilinear locally gentle algebras. These rings are examples of semilinear clannish algebras as introduced by the second author and Crawley-Boevey. We generalise the notion…

We prove a new symplectic analogue of Kashiwara's Equivalence from D-module theory. As a consequence, we establish a structure theory for module categories over deformation quantizations that mirrors, at a higher categorical level, the…

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical…

Motivated by classical facts concerning closed manifolds, we introduce a strong finiteness property in K-homology. We say that a C*-algebra has uniformly summable K-homology if all its K-homology classes can be represented by Fredholm…

We explore links between the thin concurrent games of Castellan, Clairambault and Winskel, and the weighted relational models of linear logic studied by Laird, Manzonetto, McCusker and Pagani. More precisely, we show that there is an…

We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…