{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:02Z","timestamp":1725662882009},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540091189"},{"type":"electronic","value":"9783540355175"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09118-1_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:40:42Z","timestamp":1330188042000},"page":"170-181","source":"Crossref","is-referenced-by-count":10,"title":["When are two effectively given domains identical?"],"prefix":"10.1007","author":[{"given":"Akira","family":"Kanda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Egli-Constable, Computability concepts for programming language semantics, Theoritical Computer Science, Vol. 2 (1976).","DOI":"10.1016\/0304-3975(76)90029-3"},{"key":"19_CR2","unstructured":"Kanda. A, Data types as effective objects, Theory of Computation Report No.22, Warwick University, (1977)."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Markowsky-Rosen, Bases for chain complete posets, IBM Journal of Research and Development, Vol.20, No.2, (1979).","DOI":"10.1147\/rd.202.0138"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Plotkin. G, A power domain construction, SIAM Journal on Computing, Vol.5, (1976).","DOI":"10.1137\/0205035"},{"key":"19_CR5","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H. Theory of recursive functions and effective computability, McGraw Hill, New York, (1967)."},{"key":"19_CR6","unstructured":"Tang. A, Recrusion theory and descriptive set theory in effectively given To-spaces, Ph.D. theesis, Princeton Univ. (1974)."},{"key":"19_CR7","unstructured":"Scott. D, Outline of the mathematical theory of computation, Proc. of the 4th Princeton Conference on Information Science, (1970)."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Smyth. M, Effectively given domains, Theoretical Computer Science, Vol. 5 (1977).","DOI":"10.1016\/0304-3975(77)90045-7"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Smyth-Plotkin, The categorical solution of recursive domain equattions, Proc. of the 18th IEEE FOCS Conference, (1977).","DOI":"10.1109\/SFCS.1977.30"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science 4th GI Conference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09118-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:43Z","timestamp":1605643243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09118-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540091189","9783540355175"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-09118-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}