Related papers: $\mu$-Bicomplete Categories and Parity Games
We provide several tests to determine whether a game is a potential game or whether it is a zero-sum equivalent game---a game which is strategically equivalent to a zero-sum game in the same way that a potential game is strategically…
Parity games are infinite two-player games played on directed graphs. Parity game solvers are used in the domain of formal verification. This paper defines parametrized parity games and introduces an operation, Justify, that determines a…
We define the notion of 2-filtered 2-category and give an explicit construction of the bicolimit of a category valued 2-functor. A category considered as a trivial 2-category is 2-filtered if and only if it is a filtered category, and our…
Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an…
The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a…
We generalise to a group homomorphism $\tau$ the $\chi$-graded categories of S\"{o}zer and Virelizier. These are categories in which both morphisms and objects have compatible degrees. We give a 'half-enriched' Yoneda lemma, a structure…
To any model category $\mathcal{M}$, we associate a modular model category, a functor of points $\mathcal{M}[-]:$ Cat $\rightarrow$ Cat, that associates to any small category $\mathcal{C}$ a functor category $\mathcal{M}[\mathcal{C}] =…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
We study an extension of modal $\mu$-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability…
The question "What is category theory" is approached by focusing on universal mapping properties and adjoint functors. Category theory organizes mathematics using morphisms that transmit structure and determination. Structures of…
A framework for discussing relationships between different types of games is proposed. Within the framework, quantum simultaneous games, finite quantum simultaneous games, quantum sequential games, and finite quantum sequential games are…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
Holm (H. Holm, Modules with cosupport and injective functors, Algebr. Represent. Theor., 13 (2010), 543-560) considers categories of right modules dual to those with support in a set of finitely presented modules. We extend some of his…
Strategic games admit a multi-graph representation, in which two kinds of relations, accessibility, and preferences, are used to describe how the players compare the possible outcomes. A category of games with a fixed set of players…
A number of categories is presented that are algebraically complete and cocomplete, i.e., every endofunctor has an initial algebra and a terminal coalgebra. For all finitary (and, more generally, all precontinuous) set functors the initial…
A number of categories is presented that are algebraically complete and cocomplete, i.e., every endofunctor has an initial algebra and a terminal coalgebra. For all finitary (and, more generally, all precontinuous) set functors the initial…
In his recent and exploratory work on template games and linear logic, Melli\`es defines sequential and concurrent games as categories with positions as objects and trajectories as morphisms, labelled by a specific synchronization template.…
An algebra is said to be \emph{$\tau$-tilting finite} provided it has only a finite number of $\tau$-rigid objects up to isomorphism. We associate a category to each such algebra. The objects are the wide subcategories of its category of…
Game semantics is a rich and successful class of denotational models for programming languages. Most game models feature a rather intuitive setup, yet surprisingly difficult proofs of such basic results as associativity of composition of…
We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not…