{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:17:35Z","timestamp":1772446655877,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,11,7]]},"abstract":"<jats:p>Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure is decidable. While existential quantifiers can be eliminated in linear time by application of a homomorphism, universal quantifiers are commonly eliminated via the identity $\\forall{x}. \u03a6\\equiv \\neg (\\exists{x}. \\neg \u03a6)$. If $\u03a6$ is represented in the standard way as an NFA, a priori this approach results in a doubly exponential blow-up. However, the recent literature has shown that there are classes of automatic structures for which universal quantifiers can be eliminated by different means without this blow-up by treating them as first-class citizens and not resorting to double complementation. While existing lower bounds for some classes of automatic structures show that a singly exponential blow-up is unavoidable when eliminating a universal quantifier, it is not known whether there may be better approaches that avoid the na\u00efve doubly exponential blow-up, perhaps at least in restricted settings.   In this paper, we answer this question negatively and show that there is a family of NFA representing automatic relations for which the minimal NFA recognising the language after eliminating a single universal quantifier is doubly exponential, and deciding whether this language is empty is EXPSPACE-complete. The techniques underlying our EXPSPACE lower bound further enable us to establish new lower bounds for some fragments of B\u00fcchi arithmetic with a fixed number of quantifier alternations.<\/jats:p>","DOI":"10.46298\/lmcs-22(1:14)2026","type":"journal-article","created":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T09:45:08Z","timestamp":1772444708000},"source":"Crossref","is-referenced-by-count":0,"title":["Universal quantification makes automatic structures hard to decide"],"prefix":"10.46298","volume":"Volume 22, Issue 1","author":[{"given":"Christoph","family":"Haase","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radoslaw","family":"Pi\u00f3rkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2026,2,27]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2306.10432v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2306.10432v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T09:45:09Z","timestamp":1772444709000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/13605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,27]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-22(1:14)2026","relation":{"has-preprint":[{"id-type":"arxiv","id":"2306.10432v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2306.10432v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2306.10432","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2306.10432","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,27]]},"article-number":"13605"}}