325 search results - page 27 / 65 » Proofs of Restricted Shuffles |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
This paper proves that in Size Theory the comparison of multidimensional size functions can be reduced to the 1-dimensional case by a suitable change of variables. Indeed, we show...
JAIR
2008
13 years 9 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
TCS
2008
13 years 9 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...