{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:39:36Z","timestamp":1787387976404,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540185086","type":"print"},{"value":"9783540480068","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18508-9_25","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:36:58Z","timestamp":1330198618000},"page":"158-181","source":"Crossref","is-referenced-by-count":2,"title":["Final algebras, cosemicomputable algebras, and degrees of unsolvability"],"prefix":"10.1007","author":[{"given":"Lawrence S.","family":"Moss","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph A.","family":"Goguen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/988131.988134","volume":"16","author":"J.A. Bergstra","year":"1981","unstructured":"Bergstra, J.A. and J.-J. Meyer, I\/O-Computable data structures. SIGPLAN Notices, vol. 16, no. 4 (1981), pp. 27\u201332.","journal-title":"SIGPLAN Notices"},{"key":"9_CR2","unstructured":"Bergstra, J.A. and J.V. Tucker, Algebraic specifications of computable and semicomputable data structures. Research Report IW 115, Mathematical Centre, Dept. of Computer Science, Amsterdam, 1979. Revised as University of Leeds CTCS Report 2.86. To appear in Theoretical Computer Science."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1137\/0212024","volume":"12","author":"J.A. Bergstra","year":"1983","unstructured":"Bergstra, J.A. and J.V. Tucker, Initial and final algebra semantics for data type specifications: two characterisation theorems. SIAM J. Comput., vol 12 (1983), pp. 366\u2013387.","journal-title":"SIAM J. Comput."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-10003-2_61","volume":"81","author":"J.A. Bergstra","year":"1980","unstructured":"Bergstra, J.A. and J.V. Tucker, Characterization of computable data types by means of a finite equational specification method. In J. W. de Bakker and J. van Leeuwen (eds.), Automata, Languages and Programming, Seventh Colloquium, Noordwijkerhout, Springer Lecture Notes in Computer Science, vol. 81 (1980), pp. 76\u201390.","journal-title":"Noordwijkerhout, Springer Lecture Notes in Computer Science"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/3-540-07854-1_231","volume":"45","author":"V. Giarrantana","year":"1976","unstructured":"Giarrantana, V., F. Gimona, and U. Montanari, Observability concepts in abstract data type specification. Mathematical Foundations of Computer Science '76, Springer Lecture Notes in Computer Science, vol. 45, pp. 576\u2013587, 1976.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01843493","volume":"6","author":"J.A. Goguen","year":"1973","unstructured":"Goguen, J.A., Realization is universal. Mathematical System Theory, vol 6 (1973), pp. 359\u2013374.","journal-title":"Mathematical System Theory"},{"issue":"3","key":"9_CR7","first-page":"307","volume":"11","author":"J.A. Goguen","year":"1985","unstructured":"Goguen, J.A. and J. Meseguer, Completeness of many-sorted equational logic. Algebra Universalis vol. 11 (1985), no. 3, pp. 307\u2013334. Extended abstract appeared in SIGPLAN Notices, July 1981, vol. 16, no. 7, pp. 24\u201337.","journal-title":"Algebra Universalis"},{"key":"9_CR8","unstructured":"Guttag, J.V., The Specification and Application to Programming of Abstract Data Types, Ph.D. Thesis, University of Toronto, 1975. Computer Science Department, Report CSRG-59."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Huet, G. and D.C. Oppen, Equations and rewrite rules. In R. Book (ed.), Formal Language Theory, Academic Press, 1980, 350:405.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0304-3975(79)90059-8","volume":"8","author":"M.E. Majster","year":"1979","unstructured":"Majster, M.E., Data types, abstract data types and their specification problem. Theoretical Computer Science, vol. 8 (1979), pp. 89\u2013127.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","volume":"16","author":"A.I. Malcev","year":"1961","unstructured":"Malcev, A.I., Constructive algebras I, Russian Mathematical Surveys 16(3), 1961, pp. 77\u2013129.","journal-title":"Russian Mathematical Surveys"},{"key":"9_CR12","unstructured":"Meseguer, J. and J.A. Goguen, Initiality, induction, and computability. In M. Nivat and J. Reynolds (eds.), Algebraic Methods in Semantics, pp. 459\u2013541, Cambridge University Press, 1985. Also appeared as SRI CSL Tech. Rep. 140, 1983."},{"key":"9_CR13","first-page":"341","volume":"95","author":"M. Rabin","year":"1960","unstructured":"Rabin, M., Computable algebra: general theory and theory of computable fields. Transactions of the American Mathematical Society 95(1960), pp. 341\u2013360.","journal-title":"Transactions of the American Mathematical Society"},{"key":"9_CR14","volume-title":"The Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H., The Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967."},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","volume":"19","author":"M. Wand","year":"1979","unstructured":"Wand, M., Final algebra semantics and data type extension. J. Comp. Sys. Sciences, vol. 19 (1979), pp. 27\u201344.","journal-title":"J. Comp. Sys. Sciences"}],"container-title":["Lecture Notes in Computer Science","Category Theory and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18508-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:01Z","timestamp":1605644101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18508-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540185086","9783540480068"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-18508-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}