Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics|whose combination is not disjoint since they share the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other equational theories. In this paper, we present a new approach for combining decision proce- dures for the word problem in the non-disjoint case that applies to equa- tional theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so- called normal modal logics.
|Titolo:||A New Combination Procedure for the Word Problem that generalizes Fusion Decidability in Modal Logic|
|Parole Chiave:||Combination, word problems, fusion, model completions.|
|Settore Scientifico Disciplinare:||Settore M-FIL/02 - Logica e Filosofia della Scienza|
|Data di pubblicazione:||2004|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|