Sciweavers

61 search results - page 13 / 13
» What Is the Problem with Proof Nets for Classical Logic
Sort
View
STACS
2007
Springer
13 years 11 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman