{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T21:15:49Z","timestamp":1779138949577,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540536864","type":"print"},{"value":"9783540469827","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0018436","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T00:30:30Z","timestamp":1132619430000},"page":"97-120","source":"Crossref","is-referenced-by-count":70,"title":["Action logic and pure induction"],"prefix":"10.1007","author":[{"given":"Vaughan","family":"Pratt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"7_CR1","unstructured":"G. Birkhoff. Lattice Theory, volume 25. A.M.S. Colloq. Publications, 1967."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"R.T Casley, R.F. Crew, J. Meseguer, and V.R. Pratt. Temporal structures. In Proc. Conf. on Category Theory and Computer Science, LNCS, Manchester, September 1989. Springer-Verlag. Revised version to appear in Math. Structures in Comp. Sci., 1:1.","DOI":"10.1007\/BFb0018343"},{"key":"7_CR3","first-page":"99","volume":"25","author":"A. Chandra","year":"1982","unstructured":"A. Chandra and D. Harel. Structure and complexity of relational queries. JCSS, 25:99\u2013128, 1982.","journal-title":"JCSS"},{"key":"7_CR4","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971."},{"key":"7_CR5","first-page":"331","volume":"10","author":"A. Morgan De","year":"1864","unstructured":"A. De Morgan. On the syllogism, no. IV, and on the logic of relations. Trans. Cambridge Phil. Soc., 10:331\u2013358, 1864.","journal-title":"Trans. Cambridge Phil. Soc."},{"issue":"6","key":"7_CR6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"R.W. Floyd. Algorithm 97: shortest path. Communications of the ACM, 5(6):345, 1962.","journal-title":"Communications of the ACM"},{"key":"7_CR7","unstructured":"P.J. Freyd and A. Scedrov. Categories, Allegories. North Holland, 1990."},{"key":"7_CR8","unstructured":"L. Fuchs. Partially Ordered Algebraic Systems. Pergamon Press, 1963."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J. Girard","year":"1987","unstructured":"Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"7_CR10","first-page":"118","volume":"63","author":"D. Harel","year":"1984","unstructured":"D. Harel and D. Kozen. A programming language for the inductive sets, and applications. IC, 63(1\u20132):118\u2013139, 1984. Also in Proc. 9th Int. Colloq. on Automata, Languages, and Programming, Aarhus, Denmark, July 1982.","journal-title":"IC"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02483728","volume":"15","author":"B. J\u00f3nsson","year":"1982","unstructured":"B. J\u00f3nsson. Varieties of relation algebras. Algebra Universalis, 15:273\u2013298, 1982.","journal-title":"Algebra Universalis"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"891","DOI":"10.2307\/2372123","volume":"73","author":"B. J\u00f3nsson","year":"1951","unstructured":"B. J\u00f3nsson and A. Tarski. Boolean algebras with operators. Part I. Amer. J. Math., 73:891\u2013939, 1951.","journal-title":"Amer. J. Math."},{"key":"7_CR13","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Technical Report 90-1123, Cornell U., May 1990."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"D. Kozen. On Kleene algebras and closed semirings. In B. Rovan, editor, Mathematical Foundations of Computer Science 1990, LNCS 452, pages 26\u201347, Bansk\u00e1 Bystrica, 1990. Springer-Verlag.","DOI":"10.1007\/BFb0029594"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"G.M. Kelly and R. Street. Review of the elements of 2-categories. In LNM 420. Springer-Verlag, 1974.","DOI":"10.1007\/BFb0063101"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"7_CR17","unstructured":"Y. N. Moschovakis. Elementary Induction on Abstract Structures. North-Holland, 1974."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"A.R. Meyer and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential time. In Proc. 13th IEEE Symp. on Switching and Automata Theory, pages 125\u2013129, Long Beach, CA, 1972. IEEE Computer Society.","DOI":"10.1109\/SWAT.1972.29"},{"key":"7_CR19","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. 157+iv pp."},{"key":"7_CR20","first-page":"A29","volume":"24","author":"K.C. Ng","year":"1977","unstructured":"K.C. Ng and A. Tarski. Relation algebras with transitive closure, Abstract 742-02-09. Notices Amer. Math. Soc., 24:A29\u2013A30, 1977.","journal-title":"Notices Amer. Math. Soc."},{"key":"7_CR21","unstructured":"C.S. Peirce. Description of a notation for the logic of relatives, resulting from an amplification of the conceptions of Boole's calculus of logic. In Collected Papers of Charles Sanders Peirce. III. Exact Logic. Harvard University Press, 1933."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Models of program logics. In 20th Symposium on foundations of Computer Science, San Juan, October 1979.","DOI":"10.1109\/SFCS.1979.24"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Dynamic algebras and the nature of induction. In 12th ACM Symposium on Theory of Computation, Los Angeles, April 1980.","DOI":"10.1145\/800141.804649"},{"issue":"1","key":"7_CR24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1986","unstructured":"V.R. Pratt. Modeling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33\u201371, February 1986.","journal-title":"International Journal of Parallel Programming"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Dynamic algebras as a well-behaved fragment of relation algebras. In Algebraic Logic and Universal Algebra in Computer Science, LNCS 425, Ames, Iowa, June 1988, 1990. Springer-Verlag.","DOI":"10.1007\/BFb0043079"},{"key":"7_CR26","first-page":"120","volume":"16","author":"V.N. Redko","year":"1964","unstructured":"V.N. Redko. On defining relations for the algebra of regular events (Russian). Ukrain. Mat. Z., 16:120\u2013126, 1964.","journal-title":"Ukrain. Mat. Z."},{"key":"7_CR27","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13:158\u2013169, 1966.","journal-title":"Journal of the ACM"},{"key":"7_CR28","volume-title":"Vorlesungen \u00fcber die Algebra der Logik (Exakte Logik). Dritter Band: Algebra und Logik der Relative","author":"E. Schr\u00f6der","year":"1895","unstructured":"E. Schr\u00f6der. Vorlesungen \u00fcber die Algebra der Logik (Exakte Logik). Dritter Band: Algebra und Logik der Relative. B.G. Teubner, Leipzig, 1895."},{"key":"7_CR29","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"A. Tarski. On the calculus of relations. J. Symbolic Logic, 6:73\u201389, 1941.","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"7_CR30","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"S. Warshall. A theorem on Boolean matrices. Journal of the ACM, 9(1):11\u201312, 1962.","journal-title":"Journal of the ACM"},{"key":"7_CR31","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1090\/S0002-9947-1939-1501995-3","volume":"45","author":"M. Ward","year":"1939","unstructured":"M. Ward and R.P. Dilworth. Residuated lattices. Trans. AMS, 45:335\u2013354, 1939.","journal-title":"Trans. AMS"}],"container-title":["Lecture Notes in Computer Science","Logics in AI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:36:10Z","timestamp":1586558170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540536864","9783540469827"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/bfb0018436","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}