**Theorem 12.** *The MCP for LDL-SL is non-elementary-hard.*

As for the upper bound of MCP for LDL-SL, we conjecture that we could reduce the MCP for LDL-SL into that for QCTL∗ under the tree semantics [40], inspired by the approach proposed in [41].
