{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:11:18Z","timestamp":1758280278785},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"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":[[2003,2]]},"DOI":"10.1016\/s0304-3975(02)00236-0","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:52:06Z","timestamp":1048611126000},"page":"169-188","source":"Crossref","is-referenced-by-count":12,"title":["The max-plus algebra of the natural numbers has no finite equational basis"],"prefix":"10.1016","volume":"293","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00236-0_BIB1","doi-asserted-by":"crossref","unstructured":"L. Aceto, Z. \u00c9sik, A. Ing\u00f3lfsd\u00f3ttir, On the two-variable fragment of the equational theory of the max-sum algebra of the natural numbers, in: H. Reichel, S. Tison (Eds.), Proc. 17th Internat. Symp. on Theoret. Aspects Comput. Sci., Vol. 1770, Lecture Notes in Comput. Sci., Springer, Berlin, 2000, pp. 267\u2013278. Full version available at the URL http:\/\/www.brics.dk\/RS\/99\/22\/index.html.","DOI":"10.1007\/3-540-46541-3_22"},{"key":"10.1016\/S0304-3975(02)00236-0_BIB2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1017\/S0960129597002491","article-title":"A menagerie of non-finitely based process semantics over BPA\u2217\u2014from ready simulation to completed traces","volume":"8","author":"Aceto","year":"1998","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/37.4.243","article-title":"Process algebra with iteration and nesting","volume":"37","author":"Bergstra","year":"1994","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB4","unstructured":"J. Bergstra, J.W. Klop, Fixed point semantics in process algebras, Report IW 206, Mathematisch Centrum, Amsterdam, 1982."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can't be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB6","series-title":"A Course in Universal Algebra","author":"Burris","year":"1981"},{"key":"10.1016\/S0304-3975(02)00236-0_BIB7","series-title":"Regular Algebra and Finite Machines, Mathematics Series","author":"Conway","year":"1971"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00236-0_BIB8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0304-3975(99)00079-1","article-title":"The variety of Kleene algebras with conversion is not finitely based","volume":"230","author":"Crvenkovi\u0107","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB9","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s002360050129","article-title":"Nonfinite axiomatizability of the equational theory of shuffle","volume":"35","author":"\u00c9sik","year":"1998","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB10","unstructured":"M.J. Fischer, M.O. Rabin, Super-exponential complexity of Presburger arithmetic, in: Complexity of Computation (Proc. SIAM-AMS Symposium, New York, 1973), SIAM-AMS Proc., Vol. VII, American Mathematical Society, Providence, RI, 1974, pp. 27\u201341."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","article-title":"Basic process algebra with iteration: completeness of its equational axioms","volume":"37","author":"Fokkink","year":"1994","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB12","series-title":"Universal Algebra","author":"Gr\u00e4tzer","year":"1979"},{"key":"10.1016\/S0304-3975(02)00236-0_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB14","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1090\/S0002-9947-1951-0044470-3","article-title":"Identities in two-valued calculi","volume":"71","author":"Lyndon","year":"1951","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB15","doi-asserted-by":"crossref","first-page":"24","DOI":"10.7146\/math.scand.a-10984","article-title":"Equational bases for lattice theories","volume":"27","author":"McKenzie","year":"1970","journal-title":"Math. Scand."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/S0218196796000040","article-title":"Tarski's finite basis problem is undecidable","volume":"6","author":"McKenzie","year":"1996","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0747-7171(92)90013-T","article-title":"A field guide to equational logic","volume":"14","author":"McNulty","year":"1992","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB18","unstructured":"V.L. Murski\u0131\u030c, The existence in three-valued logic of a closed class with finite basis, not having a finite complete system of identities, Dokl. Akad. Nauk SSSR 163 (1965) 815\u2013818, Sov. Math. Dokl. 6 (1965) 1020\u20131024 (in English)."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB19","first-page":"43","article-title":"The existence of a finite basis and some other properties of \u201calmost all\u201d finite algebras","volume":"30","author":"Murski\u0131\u030c","year":"1975","journal-title":"Problemy Kibernet"},{"key":"10.1016\/S0304-3975(02)00236-0_BIB20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0021-8693(64)90004-3","article-title":"Identical relations in finite groups","volume":"1","author":"Oates","year":"1965","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(02)00236-0_BIB21","unstructured":"R.E. Park, Equational classes of non-associative ordered algebras, Ph.D. Thesis, University of California at Los Angeles, 1976."},{"key":"10.1016\/S0304-3975(02)00236-0_BIB22","series-title":"5th GI Conf., Karlsruhe, Germany","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(02)00236-0_BIB23","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0304-3975(02)00236-0_BIB24","doi-asserted-by":"crossref","unstructured":"W. Taylor, Equational logic, in: B. Cs\u00e1k\u00e1ny, J. Schmidt (Eds.), Contributions to Universal Algebra, North-Holland, Amsterdam, 1977, pp. 465\u2013501; Proc. Colloq. held in Szeged, 1975, Colloquia Mathematica Societatis, J\u00e1nos Bolyai, Vol. 17.","DOI":"10.1016\/B978-0-7204-0725-9.50040-X"},{"key":"10.1016\/S0304-3975(02)00236-0_BIB25","unstructured":"W. Taylor, Equational logic, in [12], Appendix 4, pp. 378\u2013400."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502002360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502002360?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T07:13:45Z","timestamp":1580886825000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502002360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397502002360"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00236-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}