{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:36:32Z","timestamp":1774625792468,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540630456","type":"print"},{"value":"9783540690658","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:01:06Z","timestamp":1330297266000},"page":"410-418","source":"Crossref","is-referenced-by-count":8,"title":["Logical schemes for first order theories"],"prefix":"10.1007","author":[{"given":"Rostislav E.","family":"Yavorsky","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"41_CR1","unstructured":"G.S.Boolos, R.S.Jeffrey. Computability and Logic. Cambridge University Press, 1989."},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"D.Hilbert, P.Bernays, \u201cGrundlagen der Mathematik\u201d, I, Springer-Verlag, 1968.","DOI":"10.1007\/978-3-642-86894-8"},{"issue":"4","key":"41_CR3","first-page":"108","volume":"48","author":"V.E. Plisko","year":"1994","unstructured":"V.E.Plisko. Konstruktivnaja formalizatsiya teoremy Tennenbauma i ee primenenie. Mat. zametki, 48 (1994), 4, pp. 108\u2013118 (in Russian).","journal-title":"Mat. zametki"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"M.O.Rabin. Decidable Theories, in Handbook of Mathematical Logic. J. Barwise (ed.). North-Holland Publishing Company, 1977.","DOI":"10.1016\/S0049-237X(08)71116-9"},{"issue":"no.2","key":"41_CR5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.2307\/2266510","volume":"14","author":"J. Robinson","year":"1949","unstructured":"J. Robinson. Definability and decision problem in arithmetic. Journal of Symbolic Logic, 14 (1949), no. 2, pp. 98\u2013114.","journal-title":"Journal of Symbolic Logic"},{"key":"41_CR6","volume-title":"Undecidable theories","author":"A. Tarski","year":"1953","unstructured":"A. Tarski. Undecidable theories. By A. Tarski. In collab. with A. Mostovski and R.M. Robinson. Amsterdam, North-Holland publ., 1953."},{"key":"41_CR7","unstructured":"V.A. Vardanyan. Predikatnaya logika dokazuemosti bez dokazuemosti. (in Russian)"},{"key":"41_CR8","unstructured":"R.E.Yavorsky. Razreshimye logiki pervogo poryadka. Fundamentalnaja i Prikladnaja Matemetika, 1997 (in Russian, to appear)."},{"key":"41_CR9","unstructured":"R.E.Yavorsky. Predikatnye logiki razreshymykh fragmentov arifmetiki. Vestnik Moskov. Univ. Ser. 1. Mat. Mekh. 1997 (in Russian, to appear)."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:41:20Z","timestamp":1619574080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}