{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:28:53Z","timestamp":1720625333898},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":331,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1016\/j.entcs.2012.08.009","type":"journal-article","created":{"date-parts":[[2012,9,27]],"date-time":"2012-09-27T20:15:39Z","timestamp":1348776939000},"page":"117-137","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Timed Sets, Functional Complexity, and Computability"],"prefix":"10.1016","volume":"286","author":[{"given":"Robin","family":"Cockett","sequence":"first","affiliation":[]},{"given":"Joaqu\u00edn","family":"D\u00edaz-Bo\u00efls","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Gallagher","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Hrube\u0161","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2012.08.009_br0010","series-title":"Computational Complexity: a modern approach","author":"Aurora","year":"2009"},{"key":"10.1016\/j.entcs.2012.08.009_br0020","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.apal.2008.04.005","article-title":"Introduction to Turing Categories","volume":"156","author":"Cockett","year":"2008","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.entcs.2012.08.009_br0030","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0304-3975(00)00382-0","article-title":"Restriction Categories I: Categories of partial maps","volume":"270","author":"Cockett","year":"2002","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10.1016\/j.entcs.2012.08.009_br0040","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1017\/S0960129507006056","article-title":"Restriction categories III: colimits, partial limits and extensivity","volume":"17","author":"Cockett","year":"2007","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"10.1016\/j.entcs.2012.08.009_br0050","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1017\/S0960129509007543","article-title":"Boolean and Classical Restriction Categories","volume":"19","author":"Cockett","year":"2009","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/j.entcs.2012.08.009_br0060","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.entcs.2010.08.017","article-title":"A Categorical Setting for Lower Complexity","volume":"265","author":"Cockett","year":"2010","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2012.08.009_br0070","unstructured":"D. Gurr, Semantic frameworks for complexity. PhD Thesis, University of Edinburgh (1991)."},{"issue":"2","key":"10.1016\/j.entcs.2012.08.009_br0080","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1017\/S0960129508007184","article-title":"On traced monoidal closed categories","volume":"19","author":"Hasegawa","year":"2009","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"10.1016\/j.entcs.2012.08.009_br0090","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S0305004100074338","article-title":"Traced monoidal categories","volume":"119","author":"Joyal","year":"1996","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.entcs.2012.08.009_br0100","doi-asserted-by":"crossref","first-page":"595","DOI":"10.2307\/2274352","article-title":"Dominical categories: recursion theory without elements","volume":"52","author":"Di Paola","year":"1987","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/j.entcs.2012.08.009_br0110","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0890-5401(88)90034-X","article-title":"Categories of partial maps","volume":"79","author":"Robinson","year":"1988","journal-title":"Information and Computation"},{"key":"10.1016\/j.entcs.2012.08.009_br0120","series-title":"Introduction to the theory of computation","author":"Sipser","year":"1996"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066112000394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066112000394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T08:21:35Z","timestamp":1542702095000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066112000394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":12,"alternative-id":["S1571066112000394"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2012.08.009","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}