We determine the complexity of second-order HyperLTL satisfiability and model-checking: Both are as hard as truth in third-order arithmetic.
翻译:暂无翻译