We determine the complexity of second-order HyperLTL satisfiability and model-checking: Both are as hard as truth in third-order arithmetic.
翻译:我们确定了二阶HyperLTL可满足性与模型检验的复杂性:二者与三阶算术中的真值问题难度相当。