“…So, in case there is a translation, it has to be modified accordingly, for the procedure described by Antonelli and Thomason does not seem to generalize for (or ) with propositional quantification. Still, is there any recursive translation with full second-order logic, such as in Antonelli and Thomason’s case, that shows second-order and hence ( ) to be undecidable? - Even though the validity problem for n -dimensional sequence modal logics was shown to be decidable, what is its complexity?
- Is the sequence modal logic of -dimensions complete or decidable?
- Standefer (forthcoming) investigates relevant logics with the actuality operator. It would be interesting to see the relevant counterparts of multidimensional modal logics with, possibly, many actuality operators.
…”