674 search results - page 41 / 135 » Preferences in Game Logics |
108
click to vote
FSTTCS
2008
Springer
15 years 27 days ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
102
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
SCP
2008
14 years 11 months ago
2008
In [5] we build a formal verification technique for game based correctness proofs of cryptograhic algorithms based on a probabilistic Hoare style logic [10]. An important step towa...