{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:41:34Z","timestamp":1649025694830},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0304-3975(83)90102-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"225-231","source":"Crossref","is-referenced-by-count":2,"title":["Separately continuous algebras"],"prefix":"10.1016","volume":"27","author":[{"given":"Ji\u0159i","family":"Ad\u00e1mek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evelyn","family":"Nelson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90102-0_BIB1","first-page":"114","article-title":"Tree construction of free continuous algebras","volume":"24","author":"Ad\u00e1mek","year":"1982","journal-title":"J. CSS"},{"key":"10.1016\/0304-3975(83)90102-0_BIB2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0211041","article-title":"Completions of partially ordered sets","volume":"11","author":"Banaschewski","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90102-0_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(82)90013-5","article-title":"On infinite words obtained by iterating morphisms","volume":"19","author":"Culik","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90102-0_BIB4","article-title":"Algebraic semantics","volume":"99","author":"Guessarian","year":"1981"},{"key":"10.1016\/0304-3975(83)90102-0_BIB5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(82)90078-0","article-title":"On rational definitions in complete algebras without rank","volume":"21","author":"Indermark","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90102-0_BIB6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(77)90058-5","article-title":"A decideability result for deterministic \u03c9-context-free languages","volume":"4","author":"Linna","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90102-0_BIB7","first-page":"579","article-title":"Ideal monads and Z-p.o. sets","volume":"25","author":"Meseguer","year":"1978","journal-title":"Notices AMS"},{"key":"10.1016\/0304-3975(83)90102-0_BIB8","first-page":"315","article-title":"Z-continuous algebras","volume":"871","author":"Nelson","year":"1981"},{"key":"10.1016\/0304-3975(83)90102-0_BIB9","first-page":"3","article-title":"Infinite words, infinite trees, infinite computations","author":"Nivat","year":"1979"},{"key":"10.1016\/0304-3975(83)90102-0_BIB10","series-title":"Automata, Languages and Programming","first-page":"418","article-title":"A powerdomain for countable non-determinism","volume":"140","author":"Plotkin","year":"1982"},{"key":"10.1016\/0304-3975(83)90102-0_BIB11","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/0304-3975(83)90102-0_BIB12","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90102-0_BIB13","first-page":"192","article-title":"A uniform approach to inductive p.o. sets and inductive closure","volume":"53","author":"Lhatcher","year":"1977"},{"key":"10.1016\/0304-3975(83)90102-0_BIB14","article-title":"Free continuous theories","author":"Lhatcher","year":"1977","journal-title":"IBM Rept. RC 6906"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901020?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901020?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:28:54Z","timestamp":1555126134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583901020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583901020"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90102-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}