{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:46:28Z","timestamp":1648989988611},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0890-5401(03)00085-3","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"56-65","source":"Crossref","is-referenced-by-count":0,"title":["Skolem functions of arithmetical sentences"],"prefix":"10.1016","volume":"185","author":[{"given":"Shih","family":"Ping Tung","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00085-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1112\/plms\/s3-43.2.227","article-title":"The distribution of Galois groups and Hilbert\u2019s irreducibility theorem","volume":"43","author":"Cohen","year":"1981","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0890-5401(03)00085-3_BIB3","series-title":"Proc. International Congress of Mathematicians, Kyoto, Japan","article-title":"Computational complexity of higher type functions","author":"Cook","year":"1990"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB4","series-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB5","series-title":"The Computational Complexity of Logical Theories","author":"Ferrante","year":"1979"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB6","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB7","series-title":"Metamathematics of First-Order Arithmetic","author":"H\u00e1jek","year":"1993"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB8","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1137\/0216040","article-title":"Factoring multivariate polynomials over algebraic number fields","volume":"16","author":"Lenstra","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00085-3_BIB9","doi-asserted-by":"crossref","first-page":"521","DOI":"10.4064\/aa-27-1-521-553","article-title":"Reduction of an arbitrary diophantine equation to one in 13 unknowns","volume":"27","author":"Matijasevi\u010d","year":"1975","journal-title":"Acta Arith."},{"key":"10.1016\/S0890-5401(03)00085-3_BIB10","doi-asserted-by":"crossref","first-page":"494","DOI":"10.2307\/2269958","article-title":"Existence and feasibility in arithmetic","volume":"36","author":"Parikh","year":"1971","journal-title":"J. Symbol. Logic"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB11","series-title":"Contributions to the Theory of Games","first-page":"147","article-title":"Effective computability of winning strategies","volume":"vol. 39","author":"Rabin","year":"1957"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB12","first-page":"252","article-title":"Logico-combinatorial investigations in the satisfiability or provability of mathematical propositions: a simplified proof of a theorem by L. L\u00f6wenheim and generalizations of the theorem","volume":"vol. 1967","author":"Skolem","year":"1920"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB13","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(87)90013-7","article-title":"Computational complexity of diophantine equations with parameters","volume":"8","author":"Tung","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0890-5401(03)00085-3_BIB14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1006\/inco.1995.1106","article-title":"The bounds of Skolem functions and their applications","volume":"120","author":"Tung","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0890-5401(03)00085-3_BIB15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1006\/inco.1995.1116","article-title":"Computational complexity of arithmetical sentences","volume":"120","author":"Tung","year":"1995","journal-title":"Inform. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000853?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000853?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:50:27Z","timestamp":1553165427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103000853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0890540103000853"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00085-3","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}