Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
Logic in Computer Science
2024-04-19 v1
Abstract
We show that the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
Cite
@article{arxiv.cs/0411031,
title = {Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers},
author = {Ian Pratt-Hartmann},
journal= {arXiv preprint arXiv:cs/0411031},
year = {2024}
}
Comments
24 pages, 1 pstex_t figure