Uniform Notation Regained: Regular Logics
Reiner Hähnle · 1994
Abstract Two of the questions that were raised at the end of Chapter 3 are still open, namely the problem of introducing satisfactory quantifier rules, and the classification problem for many-valued tableau rules. The sets-as-signs notion from the preceding chapter, while answering the other two questions, also posed some new problems, namely the theoretically vast number of signs and the non-trivial computation of rules. The last problem has been alleviated in Section 4.5, but the need for FM tools seems to be unjustified for relatively simple logics.