Order-Invariance of Two-Variable Logic is coNExpTime-complete
Logic in Computer Science
2022-08-17 v1
Abstract
We establish coNExpTime-completeness of the problem of deciding order-invariance of a given two variable first-order formula, improving and significantly simplifying coTwoNExpTime bound by Zeume and Harwath.
Keywords
Cite
@article{arxiv.2208.07577,
title = {Order-Invariance of Two-Variable Logic is coNExpTime-complete},
author = {Bartosz Bednarczyk},
journal= {arXiv preprint arXiv:2208.07577},
year = {2022}
}