{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:19:22Z","timestamp":1775027962181,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9269,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0304-3975(88)90136-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"289-301","source":"Crossref","is-referenced-by-count":34,"title":["Subclasses of presburger arithmetic and the polynomial-time hierarchy"],"prefix":"10.1016","volume":"56","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90136-3_BIB1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(80)90037-7","article-title":"The complexity of logical theories","volume":"11","author":"Berman","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90136-3_BIB2","series-title":"Proc. Logic Colloquim 82","first-page":"263","article-title":"Decision problems in predicate logic","author":"B\u00f6rger","year":"1984"},{"key":"10.1016\/0304-3975(88)90136-3_BIB3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90136-3_BIB4","first-page":"91","article-title":"Theorem proving in arithmetic without multiplication","volume":"7","author":"Cooper","year":"1972","journal-title":"Machine Intelligence"},{"key":"10.1016\/0304-3975(88)90136-3_BIB5","article-title":"The Computational Complexity of Logical Theories","volume":"718","author":"Ferrante","year":"1979"},{"key":"10.1016\/0304-3975(88)90136-3_BIB6","first-page":"27","article-title":"Super-exponential complexity of Presburger arithmetic","volume":"7","author":"Fischer","year":"1974","journal-title":"SIAM-AMS Proc."},{"key":"10.1016\/0304-3975(88)90136-3_BIB7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90115-3","article-title":"The complexity of Presburger arithmetic with bounded quantifier alternationdepth","volume":"18","author":"F\u00fcrer","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90136-3_BIB8","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(88)90136-3_BIB9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0002-9939-1978-0500555-0","article-title":"A bound on solutions of linear integer equalities and inequalities","volume":"72","author":"Von Zur Gathen","year":"1978","journal-title":"Proc. AMS"},{"key":"10.1016\/0304-3975(88)90136-3_BIB10","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980","journal-title":"Proc. 12th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90136-3_BIB11","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0304-3975(88)90136-3_BIB12","first-page":"320","article-title":"Presburger arithmetic with bounded quantifier alternation","author":"Reddy","year":"1978","journal-title":"Proc. 10th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90136-3_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0002-9947-1984-0742421-9","article-title":"Complexity of subcases of Presburger arithmetic","volume":"284","author":"Scarpellini","year":"1984","journal-title":"Trans. AMS"},{"key":"10.1016\/0304-3975(88)90136-3_BIB14","article-title":"Complexity and Structure","volume":"211","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0304-3975(88)90136-3_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90136-3_BIB16","first-page":"23","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Warthall","year":"1977","journal-title":"Theroret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:28Z","timestamp":1555127608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0304397588901363"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90136-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}