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

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 define a notion of morphisms between open games, exploiting a surprising connection between lenses in computer science and compositional game theory. This extends the more intuitively obvious definition of globular morphisms as mappings…

Terminal coalgebras for a functor serve as semantic domains for state-based systems of various types. For example, behaviors of CCS processes, streams, infinite trees, formal languages and non-well-founded sets form terminal coalgebras. We…

In monadic programming, datatypes are presented as free algebras, generated by data values, and by the algebraic operations and equations capturing some computational effects. These algebras are free in the sense that they satisfy just the…

The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…

Let $A$ be an algebra over a field $K$ of characteristic zero, let $\d_1, >..., \d_s\in \Der_K(A)$ be {\em commuting locally nilpotent} $K$-derivations such that $\d_i(x_j)=\d_{ij}$, the Kronecker delta, for some elements $x_1,..., x_s\in…

The present work aims to give a unity of logic via standard sequential, unpolarized games. Specifically, our vision is that there must be mathematically precise concepts of linear refinement and intuitionistic restriction of logic such that…

The program of matrix product states on tensor powers $\mathcal A^{\otimes \mathbb Z}$ of $C^\ast$-algebras, initiated in Comm. Math. Phys. {\bf 144}, 443-490 (1992), is re-assessed in a context where $\mathcal A$ is a generic nuclear…

We study the classification problem of mixed states in two-dimensional quantum spin systems in the operator algebraic framework of quantum statistical mechanics. We associate a braided $C^*$-tensor category to each state satisfying a…

We extend Barr's well-known characterization of the final coalgebra of a $Set$-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a $Set$-monad $\mathbf{M}$ for functors arising as liftings.…

We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring…

We study no-signalling correlations over Cantor spaces, placing the product of infinitely many copies of a finite non-local game in a unified general setup. We define the subclasses of local, quantum spatial, approximately quantum and…

The present paper gives a mathematical, in particular, syntax-independent, formulation of intensionality and dynamics of computation in terms of games and strategies. Specifically, we give a game semantics for a higher-order programming…

We establish a generalized Perron-Frobenius theorem, based on a combinatorial criterion which entails the existence of an eigenvector for any nonlinear order-preserving and positively homogeneous map $f$ acting on the open orthant…

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player-two…

We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…

Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…

An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…

There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…