Related papers: The pebbling comonad in finite model theory

Let $A$ be a ring and $\M_A$ the category of $A$-modules. It is well known in module theory that for any $A $-bimodule $B$, $B$ is an $A$-ring if and only if the functor $-\otimes_A B: \M_A\to \M_A$ is a monad (or triple). Similarly, an $A…

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 introduce the category of bicomodules for a comonad in a Grothendieck category whose underlying functor is right exact and preserves direct sums. We characterize comonads with a separable forgetful functor by means of cohomology groups…

Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…

Given a compact, connected Lie group $K$, we use principal $K$-bundles to construct manifolds with prescribed finite-dimensional algebraic models. Conversely, let $M$ be a compact, connected, smooth manifold which supports an almost free…

We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…

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…

We analyze Coquand's game-theoretic interpretation of Peano Arithmetic through the lens of elementary descent recursion. In Coquand's game semantics, winning strategies correspond to infinitary cut-free proofs and cut elimination…

One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…

Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with…

We study and relate categories of modules, comodules and contramodules over a representation of a small category taking values in (co)algebras, in a manner similar to modules over a ringed space. As a result, we obtain a categorical…

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

Let k be a commutative ring with unit. We endow the categories of filtered complexes and of bicomplexes of k-modules, with cofibrantly generated model structures, where the class of weak equivalences is given by those morphisms inducing a…

Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…

We refine a model for linear logic based on two well-known ingredients: games and simulations. We have already shown that usual simulation relations form a sound notion of morphism between games; and that we can interpret all linear logic…

We introduce a new class of billiard systems in the plane, with boundaries formed by finitely many arcs of confocal conics such that they contain some reflex angles. Fundamental dynamical, topological, geometric, and arithmetic properties…

We introduce a complete set of combinatorial data that encode the category $2\mathfrak{Cob}$ of all $2$-cobordisms. As an application, we show that the local monoids of $2\mathfrak{Cob}$ do not have finitely axiomatizable equational…

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

We define game semantics for the constructive $\mu$-calculus and prove its equivalence to bi-relational semantics. As an application, we use the game semantics to prove that the $\mu$-calculus collapses to modal logic over the modal logic…

Kleisli simulation is a categorical notion introduced by Hasuo to verify finite trace inclusion. They allow us to give definitions of forward and backward simulation for various types of systems. A generic categorical theory behind Kleisli…