{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:16:12Z","timestamp":1649200572799},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"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":[[1990,5]]},"DOI":"10.1016\/0168-0072(90)90069-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"189-197","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for sentences over integral domains"],"prefix":"10.1016","volume":"47","author":[{"given":"Shih Ping","family":"Tung","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0168-0072(90)90069-E_BIB1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.2307\/1970573","article-title":"The elementary theory of finite fields","volume":"88","author":"Ax","year":"1968","journal-title":"Ann. of Math."},{"key":"10.1016\/0168-0072(90)90069-E_BIB2","first-page":"149","article-title":"Diophantine analysis and transcendence theory","author":"Baker","year":"1982"},{"key":"10.1016\/0168-0072(90)90069-E_BIB3","doi-asserted-by":"crossref","first-page":"1838","DOI":"10.1007\/BF01095643","article-title":"Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time","volume":"34","author":"Chistov","year":"1986","journal-title":"J. Sov. Math."},{"key":"10.1016\/0168-0072(90)90069-E_BIB4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.2307\/2318447","article-title":"Hilbert's tenth problem is unsolvable","volume":"80","author":"Davis","year":"1973","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0168-0072(90)90069-E_BIB5","unstructured":"C.W. Henson, Decidable and Undecidable Theories (North-Holland, Amsterdam, to appear)."},{"key":"10.1016\/0168-0072(90)90069-E_BIB6","unstructured":"T.W. Hungerford, Algebra, Graduate Text in Math. 73 (Springer, New York)."},{"key":"10.1016\/0168-0072(90)90069-E_BIB7","article-title":"The Art of Computer Programming","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/0168-0072(90)90069-E_BIB8","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0214015","article-title":"Factoring polynomials over algebraic number fields","volume":"14","author":"Landau","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(90)90069-E_BIB9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(84)90117-8","article-title":"Factoring multivariate integral polynomials","volume":"34","author":"Lenstra","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(90)90069-E_BIB10","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"key":"10.1016\/0168-0072(90)90069-E_BIB11","article-title":"Mathematical Logic","volume":"37","author":"Monk","year":"1976"},{"key":"10.1016\/0168-0072(90)90069-E_BIB12","author":"Schinzel","year":"1982"},{"key":"10.1016\/0168-0072(90)90069-E_BIB13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1112\/blms\/18.3.241","article-title":"Provability and decidability of arithmetical universal-existential sentences","volume":"18","author":"Tung","year":"1986","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0168-0072(90)90069-E_BIB14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1090\/S0002-9939-1988-0921004-0","article-title":"Decidable sentences over polynomial rings","volume":"102","author":"Tung","year":"1988","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(90)90069-E_BIB15","unstructured":"S.P. Tung, Computational complexity of arithmetical sentences, Preprint."},{"key":"10.1016\/0168-0072(90)90069-E_BIB16","doi-asserted-by":"crossref","unstructured":"S.P. Tung, Decidable fragments of field theories, J. Symbolic, to appear.","DOI":"10.2307\/2274469"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729090069E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729090069E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:51:51Z","timestamp":1555141911000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729090069E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["016800729090069E"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(90)90069-e","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}