{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:47Z","timestamp":1725662927070},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108566"},{"type":"electronic","value":"9783540387695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10856-4_123","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:34:19Z","timestamp":1330191259000},"page":"544-553","source":"Crossref","is-referenced-by-count":2,"title":["Admissible representations of effective cpo's"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Weihrauch","sequence":"first","affiliation":[]},{"given":"Gisela","family":"Sch\u00e4fer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"D. Scott, Data types as lattices, SIAM J. on Computing 5 (1976) 522\u2013587.","journal-title":"SIAM J. on Computing"},{"key":"54_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(76)90029-3","volume":"2","author":"H. Egli","year":"1976","unstructured":"H. Egli, R.L. Constable, Computability concepts for programming language semantics, Theoretical Computer Science 2 (1976) 133\u2013145.","journal-title":"Theoretical Computer Science"},{"key":"54_CR3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M.B. Smyth","year":"1977","unstructured":"M.B. Smyth, Effectively given domains, Theoretical Computer Science 5 (1977) 257\u2013274.","journal-title":"Theoretical Computer Science"},{"key":"54_CR4","series-title":"Lecture Notes in 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":"E. Sciore, A. Tang, Admissible coherent c.p.o.'s, in: G. Ausiello, C. B\u00f6hm, Ed., Automata, Languages and Programming, 5th Colloquium, Lecture Notes in Comp. Sci. 62 (Springer, Berlin, 1978) 440\u2013456."},{"key":"54_CR5","series-title":"Lecture Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-09118-1_19","volume-title":"Theoretical Computer Science","author":"A. Kanda","year":"1979","unstructured":"A. Kanda, D. Park, When are two effectively given domains identical, in: K. Weihrauch, Ed., Theoretical Computer Science, 4th GI-Conference, Lecture Notes in Comp. Sci. 67 (Springer, Berlin, 1979) 170\u2013181."},{"key":"54_CR6","unstructured":"K.Weihrauch, T.Deil, Berechenbarkeit auf cpo-s, Informatik-Berichte 63, RWTH Aachen (1980)."},{"key":"54_CR7","unstructured":"K.Weihrauch, Rekursionstheorie und Komplexit\u00e4tstheorie auf effektiven cpo-s, Informatik-Berichte 9, Fernuniversit\u00e4t Hagen (1980)."},{"key":"54_CR8","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers, Theory of recursive functions and effective computability (McGraw-Hill, New York, 1967)."},{"key":"54_CR9","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BFb0073967","volume-title":"Toposes, Algebraic Geometry and Logic","author":"D. Scott","year":"1972","unstructured":"D. Scott, Continuous lattices, in: F.W. Lawvere, Ed., Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics 274 (Springer, Berlin, 1972) 97\u2013136."},{"key":"54_CR10","first-page":"1","volume":"16","author":"A. Reiser","year":"1980","unstructured":"A. Reiser, K. Weihrauch, Natural numberings and generalized computability, EIK 16 (1980) 1\u20133, 11\u201320.","journal-title":"EIK"},{"key":"54_CR11","volume-title":"Computability and Unsolvability","author":"M. Davis","year":"1958","unstructured":"M. Davis, Computability and Unsolvability (McGraw-Hill, New York, 1958)."},{"key":"54_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/malq.19730190804","volume":"19","author":"J. Hauck","year":"1973","unstructured":"J. Hauck, Berechenbare reelle Funktionen, Zeitschrift f. mathem. Logik und Grundlagen der Mathematik 19 (1973) 121\u2013140.","journal-title":"Zeitschrift f. mathem. Logik und Grundlagen der Mathematik"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"G.Sch\u00e4fer, K.Weihrauch, Admissible representations of effective cpo-s, Informatik-Berichte 16, Fernuniversit\u00e4t Hagen (1981).","DOI":"10.1007\/3-540-10856-4_123"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1981"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10856-4_123.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:01Z","timestamp":1605643441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10856-4_123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108566","9783540387695"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-10856-4_123","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}