{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T07:56:56Z","timestamp":1780559816424,"version":"3.54.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":3850,"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":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00047-6","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T01:51:53Z","timestamp":1044409913000},"page":"1433-1444","source":"Crossref","is-referenced-by-count":30,"title":["The definable criterion for definability in Presburger arithmetic and its applications"],"prefix":"10.1016","volume":"290","author":[{"given":"An.A.","family":"Muchnik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00047-6_BIB1","unstructured":"J.W. Addison Jr., The undefinability of the definable, Notices Amer. Math. Soc. (12) (1965) 347."},{"issue":"4","key":"10.1016\/S0304-3975(02)00047-6_BIB2","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.2307\/2275643","article-title":"Undecidable extensions of B\u00fcchi arithmetic and Cobham\u2013Semenov theorem","volume":"62","author":"B\u00e9s","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(02)00047-6_BIB3","first-page":"191","article-title":"Logic and p-recognizable sets of integers","volume":"1","author":"Bruy\u00e8re","year":"1994","journal-title":"Bull. de la Soc. Math. de Belgique"},{"issue":"1","key":"10.1016\/S0304-3975(02)00047-6_BIB4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","article-title":"Weak second-order arithmetic and finite automata","volume":"6","author":"B\u00fcchi","year":"1960","journal-title":"Z. Math. Logik und Grundl. Math."},{"issue":"2","key":"10.1016\/S0304-3975(02)00047-6_BIB5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01746527","article-title":"On the base-dependence of sets of numbers recognizable by finite automata","volume":"3","author":"Cobham","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(02)00047-6_BIB6","doi-asserted-by":"crossref","unstructured":"C. Michaux, R. Villemaire, Cobham's theorem seen through B\u00fcchi's theorem, Proc. ICALP, Lecture Notes in Computer Science, Vol. 700, 1993, pp. 325\u2013334.","DOI":"10.1007\/3-540-56939-1_83"},{"key":"10.1016\/S0304-3975(02)00047-6_BIB7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0168-0072(95)00022-4","article-title":"Presburger arithmetic and recognizability of sets of natural numbers by automata: new proofs of Cobham's and Semenov's theorems","volume":"77","author":"Michaux","year":"1996","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(02)00047-6_BIB8","unstructured":"An.A. Muchnik, The definable criterion for definability in Presburger arithmetic and its application, preprint, Institute of New Technologies, Moscow, 1991 (in Russian)."},{"key":"10.1016\/S0304-3975(02)00047-6_BIB9","unstructured":"A.L. Semenov, On definability in some solvable theories, Ph.D. Thesis, Moscow State University, 1975."},{"issue":"2","key":"10.1016\/S0304-3975(02)00047-6_BIB10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF00967164","article-title":"Predicates that are regular in two positional systems are definable in Presburger arithmetic","volume":"18","author":"Semenov","year":"1977","journal-title":"Siberian Math. J."},{"key":"10.1016\/S0304-3975(02)00047-6_BIB11","doi-asserted-by":"crossref","unstructured":"H. Tanaka, Some results in the effective descriptive set theory, Publ. Res. Inst. Math. Sci. Kyoto Univ. Ser. A (3) (1967) 11\u201352.","DOI":"10.2977\/prims\/1195195654"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000476?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000476?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:20:37Z","timestamp":1556713237000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502000476"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00047-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}