Inductive *-semirings

Theoretical Computer Science

Volumn 324, Issue 1, 2004, Pages 3-33

  Ésik, Zoltán ^a   Kuich, Werner ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Equational logic; Least fixed point; Power series; Semiring

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; ITERATIVE METHODS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING;

EQUATIONAL LOGIC; LEAST FIXED POINT; POWER SERIES; SEMIRING;

COMPUTER SCIENCE;

EID: 4344610743     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.050     Document Type: Conference Paper

References (23)

1. H. Bekič, Definable operations in general algebras, and the theory of automata and flowcharts, Tech. Report, IBM Laboratory, Vienna, 1969.
2. Blikle A.J. Nets. complete lattices with composition Bull. Acad. Polon. Sci. Ser. Math. Astronom. Phys. 19:1971;1123-1127.
3. Bloom S.L. Varieties of ordered algebras. J. Comput. System Sci. 45:1976;200-212.
4. Bloom S.L., Ésik Z. Matrix and matricial iteration theories, part I. J. Comput. System Sci. 46:1993;381-408.
5. Bloom S.L., Ésik Z. Equational axioms for regular sets. Math. Struct. Comput. Sci. 3:1993;1-24.
6. S.L. Bloom, Z. Ésik, Iteration Theories: the Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1993.
7. Conway J.C. Regular Algebra and Finite Machines. 1971;Chapman & Hall, London.
8. Davey B.A., Priestly H.A. Introduction to Lattices and Order. 1990;Cambridge University Press, Cambridge.
9. de Bakker J.W., Scott D. A Theory of Programs. 1969;IBM, Vienna.
10. Ésik Z. Group axioms for iteration. Inform. Comput. 148:1999;131-180.
11. Ésik Z., Kuich W. A generalization of Kozen's axiomatization of the equational theory of regular sets. Ito M., Paun Gh., Yu Sheng Words, Semigroups and Transductions. 2001;99-114 World Scientific, Singapore.
12. Golan J.S. The Theory of Semirings with Applications in Computer Science. 1993;Longman Scientific and Technical, New York.
13. M. Goldstern, Vervollständigung von Halbringen, Diploma Thesis, Technical University of Vienna, 1985.
14. Hebish U. The Kleene theorem in countably complete semirings. Bayreuth. Math. Schr. 31:1990;55-66.
15. Kimmo R. Quantales and Their Applications. 1990;Longman Scientific and Technical, New York.
16. D. Kozen, On Kleene algebras and closed semirings, in: Proc. MFCS '90, Lecture Notes in Computer Science, vol. 452, Springer, Berlin, 1990, pp. 26-47.
17. D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, in: Proc. IEEE Symp. on Logic in Computer Science, 1991, pp. 214-225.
18. Krob D. Complete systems of B-rational identities. Theoret. Comput. Sci. 89:1991;207-343.
19. W. Kuich, The Kleene and Parikh theorem in complete semirings, in: Proc. ICALP'87, Lecture Notes in Computer Science, vol. 267, Springer, Berlin, 1987, pp. 212-225.
20. Manes E.G., Arbib M.A. Algebraic Approaches to Program Semantics. 1986;Springer, Berlin.
21. D.M.R. Park, Fixpoint induction and proofs of program properties, in: D. Michie, B. Meltzer (Eds.), Machine Intelligence, vol. 5, Edinburgh University Press, 1970, pp. 59-78.
22. J. Sakarovitch, Kleene's theorem revisited, Lecture Notes in Computer Science, vol. 281, Springer, Berlin, 1987, pp. 39-50.
23. W. Wechler, Universal Algebra for Computer Scientists, EATCS Monographs on Theoretical Computer Science, vol. 25, Springer, Berlin, 1992.