{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:23:57Z","timestamp":1709832237759},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch Math Logic"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1007\/bf01621094","type":"journal-article","created":{"date-parts":[[2005,4,30]],"date-time":"2005-04-30T17:17:28Z","timestamp":1114881448000},"page":"187-200","source":"Crossref","is-referenced-by-count":6,"title":["Computability by means of effectively definable schemes and definability via enumerations"],"prefix":"10.1007","volume":"29","author":[{"given":"Ivan N.","family":"Soskov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0049-237X(08)71238-2","volume-title":"Logic Colloquium '69","author":"H. Friedman","year":"1971","unstructured":"Friedman, H.: Algorithm procedures, generalized Turing algorithms and elementary recursion theory. In: Gandy, R.O., Yates, C.E.M. (eds.). Logic Colloquium '69, pp. 361\u2013389. Amsterdam: North-Holland 1971"},{"key":"CR2","first-page":"3410","volume":"258","author":"D. Lacombe","year":"1964","unstructured":"Lacombe, D.: Deux generalizations de la notion de recursivite relative. C.R. de l'Academie des Sciences de Paris258, 3410\u20133413 (1964)","journal-title":"C.R. de l'Academie des Sciences de Paris"},{"key":"CR3","first-page":"427","volume":"138","author":"Y.N. Moschovakis","year":"1969","unstructured":"Moschovakis, Y.N.: Abstract first order computability I. Trans. Am. Math. Soc.138, 427\u2013464 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"605","DOI":"10.2307\/2270854","volume":"34","author":"Y.N. Moschovakis","year":"1969","unstructured":"Moschovakis, Y.N.: Abstract computability and invariant definability. J. Symb. Logic34, 605\u2013633 (1969)","journal-title":"J. Symb. Logic"},{"key":"CR5","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers Jr., H.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967"},{"key":"CR6","first-page":"445","volume-title":"Logic Colloquium '73","author":"J.C. Shepherdson","year":"1975","unstructured":"Shepherdson, J.C.: Computation over abstract structures. In: Rose, H.E., Shepherdson, J.C. (eds.). Logic Colloquium '73, pp. 445\u2013513. Amsterdam: North-Holland 1975"},{"key":"CR7","volume-title":"Mathematical Logic and its Applications","author":"I.N. Soskov","year":"1987","unstructured":"Soskov, I.N.: Prime computability on partial structures. In: Skordev, D. (ed.) Mathematical Logic and its Applications. New York: Plenum 1987"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"428","DOI":"10.2307\/2274858","volume":"54","author":"I.N. Soskov","year":"1989","unstructured":"Soskov, I.N.: Definability via enumerations. J. Symb. Logic54, 428\u2013440 (1989)","journal-title":"J. Symb. Logic"},{"key":"CR9","volume-title":"Lect. Notes Comput. Sci.","author":"J.V. Tucker","year":"1989","unstructured":"Tucker, J.V., Zucker, J.I.: Horn programs and semicomputable relations on abstract structures. Proceedings of the 16th International Colloquium on Automata, Languages and Programming, July 1989, Stresa. (Lect. Notes Comput. Sci.). Berlin Heidelberg New York Tokyo: Springer 1989"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01621094.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01621094\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01621094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T18:30:44Z","timestamp":1557253844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01621094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["BF01621094"],"URL":"https:\/\/doi.org\/10.1007\/bf01621094","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}