{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T01:27:22Z","timestamp":1769909242905,"version":"3.49.0"},"reference-count":13,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1093\/logcom\/exu066","type":"journal-article","created":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T02:05:58Z","timestamp":1416449158000},"page":"1729-1741","source":"Crossref","is-referenced-by-count":10,"title":["A note on hereditarily \u03a010- and \u03a310-complete sets of sentences"],"prefix":"10.1093","volume":"26","author":[{"given":"Stanislav O.","family":"Speranski","sequence":"first","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2014,11,18]]},"reference":[{"key":"2016092623524268000_26.5.1729.1","doi-asserted-by":"crossref","unstructured":"B\u00f6rger E. Gr\u00e4del E. Gurevich Yu. The Classical Decison Problem. Springer; 1997.","DOI":"10.1007\/978-3-642-59207-2"},{"key":"2016092623524268000_26.5.1729.2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02485250"},{"key":"2016092623524268000_26.5.1729.3","doi-asserted-by":"crossref","unstructured":"Enderton H. B. A Mathematical Introduction to Logic. Academic Press; 2001.","DOI":"10.1016\/B978-0-08-049646-7.50005-9"},{"key":"2016092623524268000_26.5.1729.4","doi-asserted-by":"publisher","DOI":"10.1070\/RM1965v020n04ABEH001188"},{"key":"2016092623524268000_26.5.1729.5","unstructured":"Ershov Yu. L. Problems of Decidability and Constructive Models. Russian, Moscow: Nauka; 1980."},{"key":"2016092623524268000_26.5.1729.6","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1974-0325378-3"},{"key":"2016092623524268000_26.5.1729.7","doi-asserted-by":"publisher","DOI":"10.1007\/s10469-010-9075-8"},{"key":"2016092623524268000_26.5.1729.8","doi-asserted-by":"crossref","unstructured":"Lerman M. Degrees of Unsolvability. Springer; 1983.","DOI":"10.1007\/978-3-662-21755-9"},{"key":"2016092623524268000_26.5.1729.9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190967"},{"key":"2016092623524268000_26.5.1729.10","unstructured":"Rogers H. Theory of Recursive Functions and Effective Computability. McGraw-Hill; 1967."},{"key":"2016092623524268000_26.5.1729.11","doi-asserted-by":"publisher","DOI":"10.1007\/s10469-011-9148-3"},{"key":"2016092623524268000_26.5.1729.12","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exs041"},{"key":"2016092623524268000_26.5.1729.13","unstructured":"Tarski A. Mostowski A. Robinson R. Undecidable Theories. North-Holland; 1953."}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/26\/5\/1729\/6833465\/exu066.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T11:57:47Z","timestamp":1566043067000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exu066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,18]]},"references-count":13,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2016,9,26]]},"published-print":{"date-parts":[[2016,10]]}},"alternative-id":["10.1093\/logcom\/exu066"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exu066","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,18]]}}}