{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:28Z","timestamp":1759637548186},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,8,1]],"date-time":"1979-08-01T00:00:00Z","timestamp":302313600000},"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":12404,"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":[[1979,8]]},"DOI":"10.1016\/0304-3975(79)90023-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"153-172","source":"Crossref","is-referenced-by-count":11,"title":["Chain properties in P\u03c9"],"prefix":"10.1016","volume":"9","author":[{"given":"A.","family":"Tang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90023-9_BIB1","series-title":"Theory of Models","article-title":"Methods of Alternating Chains","author":"Addison","year":"1965"},{"key":"10.1016\/0304-3975(79)90023-9_BIB2","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0304-3975(79)90023-9_BIB3","article-title":"On the relation between direct and continuation semantics","author":"Reynolds","year":"1974","journal-title":"Proc. Second Colloquium on Automata, Languages and Programming"},{"key":"10.1016\/0304-3975(79)90023-9_BIB4","series-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(79)90023-9_BIB5","unstructured":"D. Scott, Continuous lattices, Lecture notes in Mathematics 274 (Springer, Berlin)."},{"key":"10.1016\/0304-3975(79)90023-9_BIB6","doi-asserted-by":"crossref","DOI":"10.1137\/0205037","article-title":"Data types as lattices","author":"Scott","year":"1976","journal-title":"Siam J. Comput."},{"key":"10.1016\/0304-3975(79)90023-9_BIB7","author":"Scott","year":"1978","journal-title":"Normal form theorems and enumeration reducibility in P\u03c9"},{"key":"10.1016\/0304-3975(79)90023-9_BIB8","article-title":"Computability theory in admissible domains","author":"Sciore","year":"1978","journal-title":"SIGACT theory of computing"},{"issue":"No. 137","key":"10.1016\/0304-3975(79)90023-9_BIB9","article-title":"Borel sets in P\u03c9","author":"Tang","year":"1975","journal-title":"IRIA Report"},{"key":"10.1016\/0304-3975(79)90023-9_BIB10","unstructured":"A. Tang and W. Wadge, Wadge reducibility in P\u03c9 (in preparation)."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900239?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900239?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:23:52Z","timestamp":1555111432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,8]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,8]]}},"alternative-id":["0304397579900239"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90023-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,8]]}}}