A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We introduce a new method (derived from model theoretic general combination procedures in automated deduction) for proving fusion decidability in modal systems. We apply it to show fusion decidability in case not only the boolean connectives, but also a universal modality and nominals are shared symbols. The second author acknowledges financial support from the European Commission through a Marie Curie Individual Fellowship. We thank V. Goranko for suggestions on an earlier version of this paper.doi:10.1007/978-3-540-39813-4_10 fatcat:xzdq5kc4cra45odldifu3drn4y