Order-Invariance of Two-Variable Logic is coNExpTime-complete

08/16/2022
by   Bartosz Bednarczyk, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset