Monadic decomposabily of regular relations
Monadic decomposibility - the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas - is a powerful tool for devising a decision procedure for a given logical theory. In this paper, we revisit a classical decision problem in...
| मुख्य लेखकों: | , , , , |
|---|---|
| स्वरूप: | Conference item |
| प्रकाशित: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2019
|