234 search results - page 9 / 47 » Proof Nets and the Identity of Proofs |
IANDC
2002
15 years 1 months ago
2002
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
106
Voted
CSL
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
CSL
2005
Springer
15 years 7 months ago
2005
Springer
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
CSL
2004
Springer
15 years 7 months ago
2004
Springer
LICS
1999
IEEE
15 years 6 months ago
1999
IEEE