{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:29:46Z","timestamp":1775096986676,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540529535","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029594","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"26-47","source":"Crossref","is-referenced-by-count":79,"title":["On kleene algebras and closed semirings"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975."},{"key":"3_CR2","volume-title":"Regular Algebra and Finite Machines","author":"John Horton Conway","year":"1971","unstructured":"John Horton Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971."},{"key":"3_CR3","unstructured":"John Horton Conway, personal communication, May 1990."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Harel, D., First-Order Dynamic Logic. Lecture Notes in Computer Science 68, Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09237-4"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Dexter Kozen, \u201cOn induction vs. *-continuity,\u201d Proc. Workshop on Logics of Programs 1981, Spring-Verlag Lect. Notes in Comput. Sci. 131, ed. Kozen, 1981, 167\u2013176.","DOI":"10.1007\/BFb0025782"},{"key":"3_CR6","unstructured":"Dexter Kozen, \u201cA completeness theorem for Kleene algebras and the algebra of regular events,\u201d Cornell TR90-1123, May 1990."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Werner Kuich, \u201cThe Kleene and Parikh Theorem in Complete Semirings,\u201d in: Proc. 14th Colloq. Automata, Languages, and Programming, ed. Ottmann, Springer-Verlag Lecture Notes in Computer Science 267, 1987, 212\u2013225.","DOI":"10.1007\/3-540-18088-5_17"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-69897-2"},{"key":"3_CR10","first-page":"A29","volume":"24","author":"K. C. Ng","year":"1977","unstructured":"K. C. Ng and A. Tarski, \u201cRelation algebras with transitive closure,\u201d Abstract 742-02-09, Notices Amer. Math. Soc. 24 (1977), A29\u2013A30.","journal-title":"Notices Amer. Math. Soc."},{"key":"3_CR11","volume-title":"Relation Algebras with Transitive Closure","author":"K. C. Ng","year":"1984","unstructured":"K. C. Ng. Relation Algebras with Transitive Closure. PhD Thesis, University of California, Berkeley, 1984."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Vaughan Pratt, \u201cSemantical Considerations on Floyd-Hoare Logic,\u201d Proc. 17th IEEE Symp. Found. Comput. Sci. 1976, 109\u2013121.","DOI":"10.1109\/SFCS.1976.27"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Vaughan Pratt, \u201cDynamic algebras and the nature of induction,\u201d Proc. 12th ACM Symp. on Theory of Computing, 1980, 22\u201328.","DOI":"10.1145\/800141.804649"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Vaughan Pratt, \u201cDynamic algebras as a well-behaved fragment of relation algebras,\u201d in: D. Pigozzi, ed., Proc. Conf. on Algebra and Computer Science, Ames, Iowa, June 2\u20134, 1988; Spring-Verlag Lecture Notes in Computer Science, to appear.","DOI":"10.1007\/BFb0043079"},{"issue":"1","key":"3_CR15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Arto Salomaa, \u201cTwo complete axiom systems for the algebra of regular events,\u201d J. Assoc. Comput. Mach. 13:1 (January, 1966), 158\u2013169.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:15:22Z","timestamp":1586578522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0029594","relation":{},"subject":[]}}