1410 search results - page 67 / 282 » Proving theorems by reuse |
DCC
2005
IEEE
14 years 9 months ago
2005
IEEE
In Theorem 6.1 of [3] it was shown that, when v = r + c - 1, every triple array TA(v, k, rr, cc, k : r ? c) is a balanced grid BG(v, k, k : r?c). Here we prove the converse of thi...
ASM
2010
ASM
14 years 7 months ago
2010
ASM
A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implem...
LICS
2002
IEEE
14 years 2 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
LICS
1999
IEEE
14 years 2 months ago
1999
IEEE
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It...
BIRTHDAY
2003
Springer
14 years 1 months ago
2003
Springer
We prove in this paper that if r and s are two semilinear power series in commuting variables and s has bounded coefficients, then r-s is a rational series. This result can be tho...