Related papers: $\mu$-Bicomplete Categories and Parity Games
We show that differential calculus (in its usual form, or in the general form of topological differential calculus) can be fully imdedded into a functor category (functors from a small category of anchord tangent algebras to anchored sets).…
We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
We describe the class of semi-stable model categories, which generalize the equivalence of finite products and coproducts in abelian and stable model categories, and use this to establish Morita equivalences among categories of functors. We…
We introduce the novel notion of winning cores in parity games and develop a deterministic polynomial-time under-approximation algorithm for solving parity games based on winning core approximation. Underlying this algorithm are a number…
There is a well-known correspondence between coherent theories (and their interpretations) and coherent categories (resp. functors), hence the (2,1)-category $\mathbf{Coh_{\sim}}$ (of small coherent categories, coherent functors and all…
Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial parameters of structures. In this paper, we develop a framework whereby the…
This paper introduces an ML / Haskell like programming language with nested inductive and coinductive algebraic datatypes called \chariot. Functions are defined by arbitrary recursive definitions and can thus lead to non-termination and…
A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding…
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…
A coextensive category can be defined as a category $\mathcal{C}$ with finite products such that for each pair $X,Y$ of objects in $\mathcal{C}$, the canonical functor $\times\colon X/\mathcal{C} \times Y/\mathcal{C} \to (X \times…
Game-theoretic characterizations of process equivalences traditionally form a central topic in concurrency; for example, most equivalences on the classical linear-time / branching-time spectrum come with such characterizations. Recent work…
The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games,…
A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…
Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…
Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modelling…
We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are "strategically equivalent" if, for every…
A completeness conjecture is advanced concerning the free small-colimit completion P(A) of a (possibly large) category A. The conjecture is based on the existence of a small generating-cogenerating set of objects in A. We sketch how the…
Let $\mathbf{C}$ be a Cauchy-complete category. The subtoposes of $[\mathbf{C}^{\mathrm{op}},\mathbf{Set}]$ are sometimes all of the form $[\mathbf{D}^{\mathrm{op}},\mathbf{Set}]$ where $\mathbf{D}$ is a full subcategory of $\mathbf{C}$.…
We prove that exact functors between the categories of perfect complexes supported on projective schemes are of Fourier--Mukai type if the functor satisfies a condition weaker than being fully faithful. We also get generalizations of the…