Related papers: $\mu$-Bicomplete Categories and Parity Games
Algorithms for model checking and satisfiability of the modal $\mu$-calculus start by converting formulas to alternating parity tree automata. Thus, model checking is reduced to checking acceptance by tree automata and satisfiability to…
The category of open games, which provides a strongly compositional foundation of economic game theory, is intermediate between symmetric monoidal and compact closed. More precisely it has counits with no corresponding units, and a…
In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…
Working over an arbitrary field, we define compact semisimple 2-categories, and show that every compact semisimple 2-category is equivalent to the 2-category of separable module 1-categories over a finite semisimple tensor 1-category. Then,…
We define natural A_infinity-transformations and construct A_infinity-category of A_infinity-functors. The notion of non-strict units in an A_infinity-category is introduced. The 2-category of (unital) A_infinity-categories, (unital)…
Bimorphic lenses are a simplification of polymorphic lenses that (like polymorphic lenses) have a type defined by 4 parameters, but which are defined in a monomorphic type system (i.e. an ordinary category with finite products). We show…
A solution concept on a class of transferable utility coalitional games is a multifunction satisfying given criteria of economic rationality. Every solution associates a set of payoff allocations with a coalitional game. This general…
Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss…
Categories of polymorphic lenses in computer science, and of open games in compositional game theory, have a curious structure that is reminiscent of compact closed categories, but differs in some crucial ways. Specifically they have a…
Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…
We introduce and develop the notion of *displayed categories*. A displayed category over a category C is equivalent to "a category D and functor F : D --> C", but instead of having a single collection of "objects of D" with a map to the…
Let $G$ be a finite group. In this paper, we first introduce a new notion, so-called the Mackey double category of $G$. Then we prove that the category of Mackey double categories and the category of Mackey functors of $G$ are equivalent.
Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht-Fraisse games, pebble games, and…
Game comonads offer a categorical view of a number of model-comparison games central to model theory, such as pebble and Ehrenfeucht-Fra\"iss\'e games. Remarkably, the categories of coalgebras for these comonads capture preservation of…
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…
An algebraically exact category in one that admits all of the limits and colimits which every variety of algebras possesses and every forgetful functor between varieties preserves, and which verifies the same interactions between these…
We define a game semantics for second order classical arithmetic PA2 (with quantifiers over predicates on integers and full comprehension axiom). Our semantics is effective: moves are described by a finite amount of information and whenever…
We define the notion of exact completion with respect to an existential elementary doctrine. We observe that the forgetful functor from the 2-category exact categories to existential elementary doctrines has a left biadjoint that can be…
We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…
We give a construction of triangulated categories as quotients of exact categories where the subclass of objects sent to zero is defined by a triple of functors. This includes the cases of homotopy and stable module categories. These…