{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:27Z","timestamp":1759638687802},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":8812,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0168-0072(89)90023-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"1-30","source":"Crossref","is-referenced-by-count":15,"title":["Dominoes and the complexity of subclasses of logical theories"],"prefix":"10.1016","volume":"43","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(89)90023-7_BIB1","article-title":"The undecidability of the domino problem","volume":"66","author":"Berger","year":"1966","journal-title":"Mem. AMS"},{"key":"10.1016\/0168-0072(89)90023-7_BIB2","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\/0168-0072(89)90023-7_BIB3","first-page":"263","article-title":"Decision problems in predicate logic","volume":"82","author":"B\u00f6rger","year":"1984"},{"key":"10.1016\/0168-0072(89)90023-7_BIB4","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\/0168-0072(89)90023-7_BIB5","doi-asserted-by":"crossref","unstructured":"K.J. Compton and C.W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/0168-0072(90)90080-L"},{"key":"10.1016\/0168-0072(89)90023-7_BIB6","series-title":"Report 83-04","article-title":"Dominoes are forever","author":"van Emde Boas","year":"1983"},{"key":"10.1016\/0168-0072(89)90023-7_BIB7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","article-title":"The first-order properties of products of algebraic systems","volume":"47","author":"Feferman","year":"1959","journal-title":"Fund. Math."},{"key":"10.1016\/0168-0072(89)90023-7_BIB8","article-title":"The computational complexity of logical theories","volume":"718","author":"Ferrante","year":"1979"},{"key":"10.1016\/0168-0072(89)90023-7_BIB9","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\/0168-0072(89)90023-7_BIB10","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 alternation depth","volume":"18","author":"F\u00fcrer","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(89)90023-7_BIB11","series-title":"Logic and Machines","first-page":"312","article-title":"The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)","volume":"171","author":"F\u00fcrer","year":"1984"},{"key":"10.1016\/0168-0072(89)90023-7_BIB12","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\/0168-0072(89)90023-7_BIB13","article-title":"The complexity of subclasses of logical theories","author":"Gr\u00e4del","year":"1987","journal-title":"Dissertation Basel"},{"key":"10.1016\/0168-0072(89)90023-7_BIB14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(88)90136-3","article-title":"Subclasses of Presburger arithmetic and the polynomial time hierarchy","volume":"56","author":"Gr\u00e4del","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(89)90023-7_BIB15","series-title":"Proc. STACS 88","first-page":"98","article-title":"Domino-games, with an application to the complexity of Boolean algebras with bounded quantifier alternations","volume":"294","author":"Gr\u00e4del","year":"1988"},{"key":"10.1016\/0168-0072(89)90023-7_BIB16","doi-asserted-by":"crossref","first-page":"460","DOI":"10.2307\/2272244","article-title":"The decision problem for standard classes","volume":"41","author":"Gurevich","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(89)90023-7_BIB17","series-title":"Languages and Computation","article-title":"Introduction to Automata Theory","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0168-0072(89)90023-7_BIB18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1073\/pnas.48.3.365","article-title":"Entscheidungsproblem reduced to the \u2200\u2203\u2200-case","volume":"48","author":"Kahr","year":"1962","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"10.1016\/0168-0072(89)90023-7_BIB19","article-title":"The Art of Computer Programming","volume":"Vol. 2","author":"Knuth","year":"1980"},{"key":"10.1016\/0168-0072(89)90023-7_BIB20","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(80)90048-1","article-title":"Complexity of Boolean algebras","volume":"10","author":"Kozen","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(89)90023-7_BIB21","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1090\/S0002-9904-1927-04368-3","article-title":"Tests for primality by the converse of Fermats Theorem","volume":"33","author":"Lehmer","year":"1927","journal-title":"Bull. AMS"},{"key":"10.1016\/0168-0072(89)90023-7_BIB22","first-page":"35","article-title":"Complexity of solvable cases of the decision problem for the predicate calculus","author":"Lewis","year":"1978","journal-title":"Proc. 19th Symp. on Foundations of Computer Science"},{"key":"10.1016\/0168-0072(89)90023-7_BIB23","series-title":"Unsolvable Classes of Quantificational Formulas","author":"Lewis","year":"1979"},{"key":"10.1016\/0168-0072(89)90023-7_BIB24","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/0168-0072(89)90023-7_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2267454","article-title":"On direct powers of theories","volume":"17","author":"Mostowski","year":"1952","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(89)90023-7_BIB26","series-title":"Primzahlverteilung","author":"Prachar","year":"1957"},{"key":"10.1016\/0168-0072(89)90023-7_BIB27","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succinct certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(89)90023-7_BIB28","first-page":"192","article-title":"\u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt","author":"Presburger","year":"1929","journal-title":"Comptes Rendues, I. Congres des Math. des Pays Slaves"},{"key":"10.1016\/0168-0072(89)90023-7_BIB29","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\/0168-0072(89)90023-7_BIB30","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","article-title":"Undecidability and non-periodicity for tilings of the plane","volume":"12","author":"Robinson","year":"1971","journal-title":"Invent. Math."},{"key":"10.1016\/0168-0072(89)90023-7_BIB31","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\/0168-0072(89)90023-7_BIB32","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/322047.322061","article-title":"Separating nondeterministic time complexity classes","volume":"25","author":"Seiferas","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0168-0072(89)90023-7_BIB33","article-title":"\u00dcber gewisse Satzfunktionen in der Arithmetik","volume":"7","author":"Skolem","year":"1930","journal-title":"Skrifter utgitt av det Norske Videnskaps-Akademi i Oslo"},{"key":"10.1016\/0168-0072(89)90023-7_BIB34","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(85)90076-6","article-title":"Real addition and the polynomial-time hierarchy","volume":"20","author":"Sontag","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0168-0072(89)90023-7_BIB35","article-title":"Komplexit\u00e4t von Entscheidungsproblemen","volume":"43","author":"Specker","year":"1976"},{"key":"10.1016\/0168-0072(89)90023-7_BIB36","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":"Theor. Comput. Sci."},{"key":"10.1016\/0168-0072(89)90023-7_BIB37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","article-title":"Proving theorems by pattern recognition II","volume":"40","author":"Wang","year":"1961","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0168-0072(89)90023-7_BIB38","series-title":"Proc. Symposioum on the Mathematical Theory of Automata","first-page":"23","article-title":"Dominoes and the \u2200\u2203\u2200 case of the decision problem","author":"Wang","year":"1962"},{"key":"10.1016\/0168-0072(89)90023-7_BIB39","series-title":"The complexity of linear problems in fields","author":"Weispfenning","year":"1986"},{"key":"10.1016\/0168-0072(89)90023-7_BIB40","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007289900237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007289900237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:58:27Z","timestamp":1555131507000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007289900237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0168007289900237"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(89)90023-7","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}