{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:56Z","timestamp":1761611156720,"version":"build-2065373602"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80756-x","type":"journal-article","created":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T07:41:43Z","timestamp":1114587703000},"page":"61-79","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["Incompleteness of Behavioral Logics"],"prefix":"10.1016","volume":"33","author":[{"given":"Samuel","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80756-X_BIB1","unstructured":"Michael Bidoit and Rolf Hennicker. Observer complete definitions are behaviourally coherent. In Kokichi Futatsugi, Joseph Goguen, and Jos\u00e9 Meseguer, editors, OBJ\/CafeOBJ\/Maude at Formal Methods '99, pages 83\u201394. Theta, 1999. Proceedings of a workshop held in Toulouse, France, 20th and 22nd September 1999."},{"key":"10.1016\/S1571-0661(05)80756-X_BIB2","doi-asserted-by":"crossref","unstructured":"Corina C\u00eerstea. A coequational approach to specifying behaviours. In Bart Jacobs and Jan Rutten, editors, Proceedings of the Second Workshop on Coalgebraic Methods in Computer Science (CMCS'99), Amsterdam, The Netherlands, March 1999, volume 19 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1999.","DOI":"10.1016\/S1571-0661(05)80274-9"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB3","article-title":"A complete calculus for equational deduction in coalgebraic specification","author":"Corradini","year":"1997","journal-title":"Technical Report SEN-R9723, ISSN 1386-396X, CWI"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB4","article-title":"Behavioral coherence in object-oriented algebraic specification","author":"Diaconescu","year":"1998","journal-title":"Technical Report IS-RR-98-0017F, Japan Advanced Institute for Science and Technology"},{"year":"1998","series-title":"CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification","author":"Diaconescu","key":"10.1016\/S1571-0661(05)80756-X_BIB5"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB6","doi-asserted-by":"crossref","unstructured":"Joseph Goguen. Types as theories. In George Michael Reed, Andrew William Roscoe, and Ralph F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357\u2013390. Oxford, 1991. Proceedings of a Conference held at Oxford, June 1989.","DOI":"10.1093\/oso\/9780198537601.003.0014"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB7","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and R\u01cezvan Diaconescu. Towards an algebraic semantics for the object paradigm. In Hartmut Ehrig and Fernando Orejas, editors, Proceedings, Tenth Workshop on Abstract Data Types, pages 1\u201329. Springer, 1994. Lecture Notes in Computer Science, Volume 785.","DOI":"10.1007\/3-540-57867-6_1"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB8","first-page":"CS97, 538","article-title":"A hidden agenda","author":"Goguen","year":"1997","journal-title":"Theoretical Computer Science, to appear 1999. Also UCSD Dept. Computer Science & Eng. Technical Report"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB9","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129599002777","article-title":"Hidden coinduction","author":"Goguen","year":"1999","journal-title":"Mathematical Structures in Computer Science, to appear"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB10","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Grigore Ro\u015fu. Hiding more of hidden algebra. In FM'99 \u2013Formal Methods, pages 1704\u20131719. Springer, 1999. Lecture Notes in Computer Sciences, Volume 1709, Proceedings of World Congress on Formal Methods, Toulouse, France.","DOI":"10.1007\/3-540-48118-4_40"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB11","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Grigore Ro\u015fu. A protocol for distributed cooperative work. In Gheorghe \u015etef\u01cenescu, editor, Proceedings of Workshop on Distributed Systems 1999 (WDS'99), Iasi, Romania, 2 September 1999, volume 28 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1999.","DOI":"10.1016\/S1571-0661(05)80625-5"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB12","doi-asserted-by":"crossref","unstructured":"H. Peter Gumm and Tobias Schr\u00f6der. Covarieties and complete covarieties. In Bart Jacobs, Larry Moss, Horst Reichel, and Jan Rutten, editors, Proceedings of the First Workshop on Coalgebraic Methods in Computer Science (CMCS'98), Lisbon, Portugal, March 1998, volume 11 of Electronic Notes in Theoretical Computer Science, pages 43\u201356. Elsevier Science, 1998.","DOI":"10.1016\/S1571-0661(04)00052-0"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB13","first-page":"263","article-title":"Observational logic","author":"Hennicker","year":"1999"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB14","doi-asserted-by":"crossref","unstructured":"Grigore Ro\u015fu. A Birkhoff-like axiomatizability result for hidden algebra and coalgebra. In Bart Jacobs, Larry Moss, Horst Reichel, and Jan Rutten, editors, Proceedings of the First Workshop on Coalgebraic Methods in Computer Science (CMCS'98), Lisbon, Portugal, March 1998, volume 11 of Electronic Notes in Theoretical Computer Science, pages 179-196. Elsevier Science, 1998.","DOI":"10.1016\/S1571-0661(04)00058-1"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB15","unstructured":"Grigore Ro\u015fu. Behavioral coinductive rewriting. In Kokichi Futatsugi, Joseph Goguen, and Jo\u015be Meseguer, editors, OBJ\/CafeOBJ\/Maude at Formal Methods '99, pages 179-196. Theta, 1999. Proceedings of a workshop held in Toulouse, France, 20th and 22nd September 1999."},{"key":"10.1016\/S1571-0661(05)80756-X_BIB16","article-title":"Equational axiomatizability for coalgebra","author":"Ro\u015fu","year":"2000","journal-title":"Theoretical Computer-Science, to appear"},{"year":"1999","series-title":"Circular coinduction","author":"Ro\u015fu","key":"10.1016\/S1571-0661(05)80756-X_BIB17"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB18","series-title":"Automated Deduction in Classical and Non-Classical Logics","first-page":"252","article-title":"Hidden congruent deduction","author":"Ro\u015fu","year":"2000"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB19","series-title":"Automated Deduction in Classical and Non-Classical Logics","first-page":"252","article-title":"Hidden congruent deduction","author":"Ro\u015fu","year":"1998"},{"year":"1987","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/S1571-0661(05)80756-X_BIB20"},{"key":"10.1016\/S1571-0661(05)80756-X_BIB21","article-title":"Universal coalgebra: a theory of systems","author":"Rutten","year":"1996","journal-title":"Technical Report CS-R9652, CWI"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580756X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580756X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:17Z","timestamp":1761610097000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610580756X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":21,"alternative-id":["S157106610580756X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80756-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Incompleteness of Behavioral Logics","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80756-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}