{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T02:50:10Z","timestamp":1656384610288},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":7017,"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":[[1994,5]]},"DOI":"10.1016\/0304-3975(94)90098-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"1-23","source":"Crossref","is-referenced-by-count":1,"title":["A formal derivation of the decidability of the theory SA"],"prefix":"10.1016","volume":"127","author":[{"given":"C.","family":"Hosono","sequence":"first","affiliation":[]},{"given":"Y.","family":"Ikeda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90098-1_BIB1","series-title":"Symbolic Computation Automation of Reasoning, Vol. 1","first-page":"41","article-title":"A computer program for Presburger's algorithm","author":"Davis","year":"1957"},{"key":"10.1016\/0304-3975(94)90098-1_BIB2","first-page":"54","article-title":"On a decidability of the rational Presburger arithmetic","volume":"Vol. 9","author":"Hosono","year":"1992","journal-title":"Computer Software"},{"key":"10.1016\/0304-3975(94)90098-1_BIB3","series-title":"Proc. Inf. 83","first-page":"657","article-title":"The v-conversion and an analytic semantics","author":"Igarashi","year":"1983"},{"key":"10.1016\/0304-3975(94)90098-1_BIB4","series-title":"Master's Thesis","article-title":"On an interpreter of the higher typed logical programming language NU","author":"Ikeda","year":"1989"},{"key":"10.1016\/0304-3975(94)90098-1_BIB5","first-page":"293","article-title":"A design of NU interpreter","author":"Ikeda","year":"1990","journal-title":"Proc. 7th Conf. Japan Society for Software Science and Technology"},{"key":"10.1016\/0304-3975(94)90098-1_BIB6_1","first-page":"92","article-title":"\u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen in welchem die Addition als einzige Operation hervortritt","author":"Presburger","year":"1930","journal-title":"Comptes-Rendus du Congres des Mathematicians des Pays Slaves"},{"key":"10.1016\/0304-3975(94)90098-1_BIB6_2","first-page":"395","article-title":"\u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen in welchem die Addition als einzige Operation hervortritt","author":"Presburger","year":"1930","journal-title":"Comptes-Rendus du Congres des Mathematicians des Pays Slaves"},{"key":"10.1016\/0304-3975(94)90098-1_BIB7","series-title":"Proc. Conf. Record of 10th Ann. ACM Symp. on Theory of Computing","first-page":"320","article-title":"Presburger arithmetic with bounded quantifier alternation","author":"Reddy","year":"1978"},{"key":"10.1016\/0304-3975(94)90098-1_BIB8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0002-9947-1984-0742421-9","article-title":"Complexity of subcase of Presburger arithmetic","volume":"284","author":"Scarpellimi","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(94)90098-1_BIB9","series-title":"Selected Works in Logic","first-page":"281","article-title":"\u00dcber einige Satzfunktionen in der Arithmetik","author":"Skolem","year":"1970"},{"key":"10.1016\/0304-3975(94)90098-1_BIB10","series-title":"Logical Number Theory I","author":"Smory\u0144ski","year":"1990"},{"key":"10.1016\/0304-3975(94)90098-1_BIB11","doi-asserted-by":"crossref","unstructured":"K. W\u00f6hl, Zur Komplexit\u00e4t der Presburger Arithmetik und des \u00c4quivalenzproblems einfacher Programme, in: Theoret. Comput. Sci. 4th GI Conf., 1979, Lecture Notes in Computer Science, Vol. 67 (Springer, Berlin) 310\u2013318.","DOI":"10.1007\/3-540-09118-1_32"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900981?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:27:11Z","timestamp":1555129631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0304397594900981"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90098-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}