{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:35Z","timestamp":1725663395964},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190202"},{"type":"electronic","value":"9783540389200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19020-1_20","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:55:05Z","timestamp":1330199705000},"page":"372-384","source":"Crossref","is-referenced-by-count":1,"title":["Computable one-to-one enumerations of effective domains"],"prefix":"10.1007","author":[{"given":"Dieter","family":"Spreen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-3975(76)90029-3","volume":"2","author":"H. Egli","year":"1976","unstructured":"Egli, H. and R. L. Constable (1976), Computability concepts for programming language semantics, Theoret. Comp. Sci.\n2, p. 133\u2013145.","journal-title":"Theoret. Comp. Sci."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19730191901","volume":"19","author":"Yu. L. Er\u0161ov","year":"1972","unstructured":"Er\u0161ov, Yu. L. (1972), Theorie der Numerierungen I, Zeitschr. f. math. Logik u. Grundl. d. Math.\n19, p. 289\u2013388.","journal-title":"Zeitschr. f. math. Logik u. Grundl. d. Math."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R. M. Friedberg","year":"1958","unstructured":"Friedberg, R. M. (1958), Three theorems on recursive enumeration. I. Decomposition. II. Maximal sets. III. Enumeration without duplication, J. Symb. Logic\n23, p. 309\u2013316.","journal-title":"J. Symb. Logic"},{"key":"20_CR4","unstructured":"Kanda, A. (1980), G\u00f6del Numbering of Domain Theoretic Computable Functions, Report Nr. 138, Dept. of Computer Science, University of Leeds."},{"key":"20_CR5","series-title":"Lec. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-09118-1_19","volume-title":"When are two effectively given domains identical?","author":"A. Kanda","year":"1979","unstructured":"Kanda, A. and D. Park (1979), When are two effectively given domains identical? Theoretical Computer Science, 4th GI Conference, Aachen 1979 (Weihrauch, K. ed.), p. 170\u2013181, Lec. Notes Comp. Sci. 67, Springer, Berlin."},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02219834","volume":"8","author":"A. B. Khutoretskii","year":"1970","unstructured":"Khutoretski\n                  \n                    \n                  \n                  \n$$\\overset{\\lower0.5em\\hbox{$\\smash{\\scriptscriptstyle\\smile}$}}{\\imath }$$\n\n                , A. B. (1970), On the reducibility of computable enumerations, Algebra and Logic\n8, p. 145\u2013151.","journal-title":"Algebra and Logic"},{"key":"20_CR7","unstructured":"Kreitz, Ch. (1982), Zul\u00e4ssige cpo's, ein Entwurf f\u00fcr ein allgemeines Berechenbarkeitskonzept, Schriften zur Angew. Math. u. Informatik Nr. 76, RWTH Aachen."},{"key":"20_CR8","volume-title":"Algorithms and Recursive Functions","author":"A. I. Mal'cev","year":"1970","unstructured":"Mal'cev, A. I. (1970), Algorithms and Recursive Functions, Wolters-Noordhoff, Groningen."},{"key":"20_CR9","first-page":"252","volume":"15","author":"M. B. Pour-El","year":"1964","unstructured":"Pour-El, M. B. (1964), G\u00f6del numberings versus Friedberg numberings, Proc. Amer. Math. Soc.\n15, p. 252\u2013256.","journal-title":"Proc. Amer. Math. Soc."},{"key":"20_CR10","unstructured":"Riccardi, G. A. (1980), The Independence of Control Structures in Abstract Programming Systems, PhD Thesis, State Univ. of Buffalo."},{"key":"20_CR11","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers, H. Jr. (1967), Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/malq.19770232505","volume":"23","author":"B. Schinzel","year":"1977","unstructured":"Schinzel, B. (1977), Decomposition of G\u00f6delnumberings into Friedbergnumberings, Zeitschr. f. math. Logik u. Grundl. d. Math.\n23, p. 393\u2013399.","journal-title":"Zeitschr. f. math. Logik u. Grundl. d. Math."},{"key":"20_CR13","series-title":"Lec. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/3-540-08860-1_33","volume-title":"Automata, Languages and Programming","author":"E. Sciore","year":"1978","unstructured":"Sciore, E. and A. Tang (1978a), Admissible coherent c.p.o.'s, Automata, Languages and Programming (Ausiello, G and B\u00f6hm, C., eds.), p. 440\u2013456, Lec. Notes Comp. Sci. 6, Springer, Berlin."},{"key":"20_CR14","first-page":"95","volume-title":"Computability theory in admissible domains","author":"E. Sciore","year":"1978","unstructured":"Sciore, E. and A. Tang (1978b), Computability theory in admissible domains, 10th Annual Symp. on Theory of Computing, San Diego 1978, p. 95\u2013104, Ass. Com. Mach., New York."},{"key":"20_CR15","unstructured":"Scott, D. S. (1970), Outline of a Mathematical Theory of Computation, Techn. Monograph PRG-2, Oxford Univ. Comp. Lab."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M. B. Smyth","year":"1977","unstructured":"Smyth, M. B. (1977), Effectively given domains, Theoret. Comp. Sci.\n5, p. 257\u2013274.","journal-title":"Theoret. Comp. Sci."},{"key":"20_CR17","unstructured":"Weihrauch, K. and Th. Deil (1980), Berechenbarkeit auf cpo-s, Schriften zur Angew. Math. u. Informatik Nr. 63, RWTH Aachen."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Language Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19020-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:18:59Z","timestamp":1619558339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19020-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190202","9783540389200"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-19020-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}