{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:11Z","timestamp":1725663191776},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187400"},{"type":"electronic","value":"9783540481386"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18740-5_105","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:41:35Z","timestamp":1330198895000},"page":"479-482","source":"Crossref","is-referenced-by-count":0,"title":["Deductive program synthesis and Markov's principle"],"prefix":"10.1007","author":[{"given":"A. A.","family":"Voronkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"1","key":"105_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.2977\/prims\/1195182986","volume":"19","author":"M. Hagiya","year":"1983","unstructured":"Hagiya M. A Proof Description Language and Its Reduction System. Publications of the Research Institute of Mathematics,1983,v.19,N 1, p.237\u2013261.","journal-title":"Publications of the Research Institute of Mathematics"},{"issue":"3","key":"105_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(83)90060-1","volume":"16","author":"R.L. Constable","year":"1983","unstructured":"R.L. Constable. Programs as Proofs: A Synopsis. \u2014 Information Processing Letters,1983,v.16,N 3,p. 105\u2013112.","journal-title":"Information Processing Letters"},{"key":"105_CR3","doi-asserted-by":"crossref","unstructured":"P.Martin-L\u00f6f. An Intuitionistic theory of Types,Predicative Part. In: Logic Colloquim'73, North-Holland,1975,p.73\u2013118.","DOI":"10.1016\/S0049-237X(08)71945-1"},{"key":"105_CR4","unstructured":"A.A.Voronkov. An Intuitionistic List Theory.(Russian)\u2014 In: Proc. 8-th USSR National Conf.on Mathematical Logic,Moscow Univ.,1986,p.32."},{"key":"105_CR5","unstructured":"Y.L.Ershov. Enumeration Theory (Russian). \u2014 Nauka, 1977"},{"key":"105_CR6","unstructured":"A.I.Maltsev. Algorithms and Recursive Functions.(Russian)\u2014 Nauka, 1965."},{"key":"105_CR7","unstructured":"A.A.Markov,N.M.Nagorny. Algorithm Theory (Russian). \u2014 Nauka, 1984."},{"key":"105_CR8","unstructured":"A.A.Voronkov. Logic Program Synthesis (Russian).\u2014 Preprint N 24, Institute of Mathematics of the Siberian Branch of the USSR Academy of Sciences,1986."},{"key":"105_CR9","doi-asserted-by":"crossref","unstructured":"J.Barwise. Admissible Sets and Structures. \u2014 Springer Verlag,1975.","DOI":"10.1007\/978-3-662-11035-5"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18740-5_105.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:20Z","timestamp":1605644120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18740-5_105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187400","9783540481386"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-18740-5_105","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}