Abstract
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evaluated along intervals instead of at states. Action logic is an equational theory ACT conservatively extending the equational theory REG of regular expressions with operations preimplication a→b (had a then b) and postimplication b←a (b if-ever a). Unlike REG, ACT is finitely based, makes a* reflexive transitive closure, and has an equivalent Hilbert system. The crucial axiom is that of pure induction, (a→a)* = a→a.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Birkhoff. Lattice Theory, volume 25. A.M.S. Colloq. Publications, 1967.
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.
A. Chandra and D. Harel. Structure and complexity of relational queries. JCSS, 25:99–128, 1982.
J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.
A. De Morgan. On the syllogism, no. IV, and on the logic of relations. Trans. Cambridge Phil. Soc., 10:331–358, 1864.
R.W. Floyd. Algorithm 97: shortest path. Communications of the ACM, 5(6):345, 1962.
P.J. Freyd and A. Scedrov. Categories, Allegories. North Holland, 1990.
L. Fuchs. Partially Ordered Algebraic Systems. Pergamon Press, 1963.
Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
D. Harel and D. Kozen. A programming language for the inductive sets, and applications. IC, 63(1–2):118–139, 1984. Also in Proc. 9th Int. Colloq. on Automata, Languages, and Programming, Aarhus, Denmark, July 1982.
B. Jónsson. Varieties of relation algebras. Algebra Universalis, 15:273–298, 1982.
B. Jónsson and A. Tarski. Boolean algebras with operators. Part I. Amer. J. Math., 73:891–939, 1951.
D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Technical Report 90-1123, Cornell U., May 1990.
D. Kozen. On Kleene algebras and closed semirings. In B. Rovan, editor, Mathematical Foundations of Computer Science 1990, LNCS 452, pages 26–47, Banská Bystrica, 1990. Springer-Verlag.
G.M. Kelly and R. Street. Review of the elements of 2-categories. In LNM 420. Springer-Verlag, 1974.
S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.
Y. N. Moschovakis. Elementary Induction on Abstract Structures. North-Holland, 1974.
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–129, Long Beach, CA, 1972. IEEE Computer Society.
K.C. Ng. Relation Algebras with Transitive Closure. PhD thesis, University of California, Berkeley, 1984. 157+iv pp.
K.C. Ng and A. Tarski. Relation algebras with transitive closure, Abstract 742-02-09. Notices Amer. Math. Soc., 24:A29–A30, 1977.
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.
V.R. Pratt. Models of program logics. In 20th Symposium on foundations of Computer Science, San Juan, October 1979.
V.R. Pratt. Dynamic algebras and the nature of induction. In 12th ACM Symposium on Theory of Computation, Los Angeles, April 1980.
V.R. Pratt. Modeling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33–71, February 1986.
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.
V.N. Redko. On defining relations for the algebra of regular events (Russian). Ukrain. Mat. Z., 16:120–126, 1964.
A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13:158–169, 1966.
E. Schröder. Vorlesungen über die Algebra der Logik (Exakte Logik). Dritter Band: Algebra und Logik der Relative. B.G. Teubner, Leipzig, 1895.
A. Tarski. On the calculus of relations. J. Symbolic Logic, 6:73–89, 1941.
S. Warshall. A theorem on Boolean matrices. Journal of the ACM, 9(1):11–12, 1962.
M. Ward and R.P. Dilworth. Residuated lattices. Trans. AMS, 45:335–354, 1939.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pratt, V. (1991). Action logic and pure induction. In: van Eijck, J. (eds) Logics in AI. JELIA 1990. Lecture Notes in Computer Science, vol 478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018436
Download citation
DOI: https://doi.org/10.1007/BFb0018436
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53686-4
Online ISBN: 978-3-540-46982-7
eBook Packages: Springer Book Archive