{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:34:10Z","timestamp":1753889650961,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,2,12]],"date-time":"2014-02-12T00:00:00Z","timestamp":1392163200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We prove that the complexity of the uniform first-order theory of ground tree\nrewrite graphs is in ATIME(2^{2^{poly(n)}},O(n)). Providing a matching lower\nbound, we show that there is some fixed ground tree rewrite graph whose\nfirst-order theory is hard for ATIME(2^{2^{poly(n)}},poly(n)) with respect to\nlogspace reductions. Finally, we prove that there exists a fixed ground tree\nrewrite graph together with a single unary predicate in form of a regular tree\nlanguage such that the resulting structure has a non-elementary first-order\ntheory.<\/jats:p>","DOI":"10.2168\/lmcs-10(1:7)2014","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T09:40:14Z","timestamp":1405417214000},"source":"Crossref","is-referenced-by-count":1,"title":["The First-Order Theory of Ground Tree Rewrite Graphs"],"prefix":"10.46298","volume":"Volume 10, Issue 1","author":[{"given":"Stefan","family":"G\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2014,2,12]]},"reference":[{"key":"802:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1223\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1223\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:06:05Z","timestamp":1681243565000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,12]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(1:7)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1107.0919","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1107.0919","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2014,2,12]]},"article-number":"1223"}}