相关论文: Sequoidal Categories and Transfinite Games: A Coal…

The method of direct computation of universal (fibred) product in the category of commutative associative algebras of finite type with unity over a field is given and proven. The field of coefficients is not supposed to be algebraically…

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…

Adapting the idea of twisted tensor products to the category of finitely generated algebras, we define on its opposite, the category QLS of quantum linear spaces, a family of objects hom(B,A)^{op}, one for each pair A^{op},B^{op} there,…

Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to…

We consider 3XOR games with perfect commuting operator strategies. Given any 3XOR game, we show existence of a perfect commuting operator strategy for the game can be decided in polynomial time. Previously this problem was not known to be…

For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…

Can classical game-theoretic frameworks be extended to capture the bounded rationality and causal reasoning of AI agents? We investigate this question by extending Causal Normal Form Games (CNFGs) to sequential settings, introducing…

We show that the C*-algebras associated with synchronous games give rise to certain quantum families of maps between the input and output sets of the game. In particular situations (e.g. for graph endomorphism games) these quantum families…

We define and study a collection of matroid isomorphism games corresponding to various axiomatic characterizations of matroids. These are nonlocal games played between two cooperative players. Each game is played on two matroids, and the…

We introduce a two-player nonlocal game, called the $(G,H)$-isomorphism game, where classical players can win with certainty if and only if the graphs $G$ and $H$ are isomorphic. We then define the notions of quantum and non-signalling…

We consider a hierarchy of four typed call-by-value languages with either higher-order or ground-type references and with either callcc or no control operator.Our first result is a fully abstract trace model for the most expressive setting,…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

The present paper introduces a novel notion of `(effective) computability', called viability, of strategies in game semantics in an intrinsic (i.e., without recourse to the standard Church-Turing computability), non-inductive and…

Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Game comonads, introduced by Abramsky, Dawar and Wang and developed by Abramsky and Shah, give an interesting categorical semantics to some Spoiler-Duplicator games that are common in finite model theory. In particular they expose…

We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…

We recast move generators for solving board games as operations on compressed sets of strings. We aim for compressed representations with space sublinear in the number of game positions for interesting sets of positions, move generation in…

Non-local games (NLGs) provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product…

Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe the structure of their instances by the following equational…