AI Chat AI Image Generator AI Video Text to Speech

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

page 1

page 2

page 3

page 4

Related Research

research
∙ 04/17/2023

About the Expressive Power and Complexity of Order-Invariance with Two Variables

Order-invariant first-order logic is an extension of first-order logic (...
0 Bartosz Bednarczyk, et al. ∙
research
∙ 04/26/2022

On an Invariance Problem for Parameterized Concurrent Systems

We consider concurrent systems consisting of replicated finite-state pro...
0 Marius Bozga, et al. ∙
research
∙ 05/13/2021

Deciding FO-definability of Regular Languages

We prove that, similarly to known PSpace-completeness of recognising FO(...
0 Agi Kurucz, et al. ∙
research
∙ 05/11/2018

On the Parameterized Complexity of Graph Modification to First-Order Logic Properties

We consider the problems of deciding whether an input graph can be modif...
0 Fedor V. Fomin, et al. ∙
research
∙ 04/23/2020

On the NP-Completeness of Satisfying Certain Path and Loop Puzzles

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles ...
0 Hadyn Tang, et al. ∙
research
∙ 06/30/2023

Simulating elliptic diffusions and orthogonal invariance

We study numerical methods for simulating diffusions that exploit the or...
0 Charles Curry, et al. ∙
research
∙ 07/17/2022

HyperInvariances: Amortizing Invariance Learning

Providing invariances in a given learning task conveys a key inductive b...
9 Ruchika Chavhan, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal