Related papers: Two Remarks about Game Semantics of Classical Logi…
We propose an extension of Strategy Logic (SL), in which one can both reason about strategizing under imperfect information and about players' knowledge. One original aspect of our approach is that we do not force strategies to be uniform,…
We define a semantics for Milner's pi-calculus, with three main novelties. First, it provides a fully-abstract model for fair testing equivalence, whereas previous semantics covered variants of bisimilarity and the may and must testing…
This paper revisits timed games by building upon the semantics introduced in "The Element of Surprise in Timed Games". We introduce some modifications to this semantics for two primary reasons: firstly, we recognize instances where the…
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.
A recurring problem in game semantics is to enforce uniformity in strategies. Informally, a strategy is uniform when the Player's behaviour does not depend on the particular indexing of moves chosen by the Opponent. In game semantics,…
We propose the study of mathematical ludology, which aims to formally interrogate questions of interest to game studies and game design in particular. The goal is to extend our mathematical understanding of complex games beyond…
We propose a quantum-like description of markets and economics. The approach has roots in the recently developed quantum game theory.
It has been shown that a functional interpretation of proofs in mathematical analysis can be given by the product of selection functions, a mode of recursion that has an intuitive reading in terms of the computation of optimal strategies in…
Game semantics has provided adequate models for a variety of programming languages, in which types are interpreted as two-player games and programs as strategies. Melli\`es (2018) suggested that such categories of games and strategies may…
Here, by introducing a version of "Unexpected hanging paradox" we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system…
In this work we have introduced two party games with respective winning conditions. One cannot win these games deterministically in the classical world if they are not allowed to communicate at any stage of the game. Interestingly we find…
By using the abstract structures investigated in the first Part of this article, we develop a semantics for an epistemic language, which expresses sentences like "Alice knows that Bob does not understand that PI is irrational". One is…
In 1932, G\"odel proved that there is no finite semantics for intuitionistic logic. We consider all fragments of intuitionistic logic and check in each case whether a finite semantics exists. We may fulfill a didactic goal, as little logic…
Traditionally, semantics has been seen as a feature of human language. The advent of the information era has led to its widespread redefinition as an information feature. Contrary to this praxis, I define semantics as a special kind of…
We prove two (strong) undefinability results for logics based on inquisitive semantics (or its variant, team semantics). Namely: 1) we show the undefinability of intuitionistic implication in extended propositional inquisitive logic with…
We give in this paper a logical characterization for unambiguous Context Free Languages, in the vein of descriptive complexity. A fragment of the logic characterizing context free languages given by Lautemann, Schwentick and Th\'erien [18]…
The analysis of games played on graph-like structures is of increasing importance due to the prevalence of social networks, both virtual and physical, in our daily life. As well as being relevant in computer science, mathematical analysis…
Characterizations of semi-stable and stage extensions in terms of 2-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming…
We present a new game semantics for Martin-L\"of type theory (MLTT), our aim is to give a mathematical and intensional explanation of MLTT. Specifically, we propose a category with families of a novel variant of games, which induces a…
The so called \emph{quantum game theory} has recently been proclaimed as one of the new branches in the development of both quantum information theory and game theory. However, the notion of a quantum game itself has never been strictly…