Skip to main content Accessibility help

Dagger extension theorem

  • Z. ÉSIK (a1) and T. HAJGATÓ (a1)

Partial iterative theories are algebraic theories such that for certain morphisms f the equation ξ = f ⋅ 〈ξ, 1p〉 has a unique solution. Iteration theories are algebraic theories satisfying a certain set of identities. We investigate some similarities between partial iterative theories and iteration theories.

In our main result, we give a sufficient condition ensuring that the partially defined dagger operation of a partial iterative theory can be extended to a totally defined operation so that the resulting theory becomes an iteration theory. We show that this general extension theorem can be instantiated to prove that every Elgot iterative theory with at least one constant morphism 1 → 0 can be extended to an iteration theory. We also apply our main result to theories equipped with an additive structure.

Hide All
de Bakker, J. W. and Scott, D. (1969) A theory of programs, IBM Seminar, Vienna.
Bekić, H. (1984) Definable operations in general algebras and the theory of automata and flowcharts. Springer-Verlag Lecture Notes in Computer Science 177 3055.
Bloom, S. L., Elgot, C. C. and Wright, J. B. (1980a) Solutions of the iteration equation and extension of the scalar iteration operation. SIAM J. Computing 9 2645.
Bloom, S. L., Elgot, C. C. and Wright, J. B. (1980b) Vector iteration in pointed iterative theories. SIAM J. Computing 9 525540.
Bloom, S. L. and Ésik, Z. (1993) Iteration Theories, Springer-Verlag.
Bloom, S. L. and Ésik, Z. (2003) An extension theorem with an application to formal tree series. J. of Automata, Languages and Combinatorics 8 (2)145185.
Bloom, S. L. and Ésik, Z. (2009) Axiomatizing rational power series over natural numbers. Information and Computation 207 793811.
Bloom, S. L., Ginali, S. and Rutledge, J. D. (1977) Scalar and vector iteration. J. Comput. System Sci. 14 251256.
Elgot, C. C. (1976) Matricial theories. J. Algebra 42 391421.
Elgot, C. C. (1973) Monadic computation and iterative algebraic theories. Logic Colloquium '73, Studies in Logic and the Foundations of Mathematics 80, North-Holland175230.
Ésik, Z. (1980) Identities in iterative and rational algebraic theories. Computational Linguistics and Computer Languages XIV 183207.
Ésik, Z. (1982) On generalized iterative algebraic theories. Computational Linguistics and Computer Languages XV 95110.
Ésik, Z. (1997) Completeness of Park induction. Theoret. Comput. Sci. 177 217283.
Ésik, Z. (1999) Group axioms for iteration. Information and Computation 148 131180.
Ésik, Z. and Kuich, W. (2003) Formal tree series. J. Autom. Lang. Comb. 8 219285.
Fokkink, W. (2007) Introduction to Process Algebra, Computer Science – Monograph, Springer-Verlag.
Golan, J. (1999) Semirings and Their Applications, Kluwer Academic Publishers.
Lawvere, F. W. (1963) Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. U.S.A. 50 869872.
Niwinski, D. (1985) Equational μ-calculus. In: Skowron, A. (ed.) Computation theory – Proceedings, Fifth Symposium, Zaborów, Poland. Springer-Verlag Lecture Notes in Computer Science 208 169176.
Niwinski, D. (1986) On fixed-point clones (extended abstract). In: Kott, L. (ed.) Automata, languages and programming – Proceedings 13th International Colloquium. Springer-Verlag Lecture Notes in Computer Science 226 464473.
Park, D. M. R. (1970) Fixed point induction and proofs of program properties. In: Michie, D. and Meltzer, B. (eds.) Machine Intelligence 5, Edinburgh University Press 5978.
Plotkin, G. (1983) Domains, University of Edinburgh.
Simpson, A. and Plotkin, G. (2000) Complete axioms for categorical fixed-point operators. 15th Annual IEEE Symposium on Logic in Computer Science (Santa Barbara, CA, 2000), IEEE Computer Society Press 3041.
Wright, J. B., Thatcher, J. W., Wagner, E. G. and Goguen, J. A. (1976) Rational algebraic theories and fixed-point solutions, 17th Annual Symposium on Foundations of Computer Science, IEEE Computer Society 147158.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed