×

Dagger extension theorem. (English) Zbl 1241.18005

The paper considers partial iteration theories, which are Lawvere theories \(T\) [F. W. Lawvere, “Functorial semantics of algebraic theories and some algebraic problems in the context of functorial semantics of algebraic theories”, Repr. Theory Appl. Categ. 2004, No. 5, 1–121 (2004; Zbl 1062.18004)], equipped with a partial dagger operation, which is defined on a certain ideal \(D(T)\) of the set of morphisms of \(T\), and which additionally satisfies certain identities. In particular, if \(D(T)\) is the whole set of \(T\)-morphisms, then one obtains iteration theories of S. L. Bloom, C. C. Elgot and J. B. Wright [“Solutions of the iteration equation and extensions of the scalar iteration operation”, SIAM J. Comput. 9, 25–45 (1980; Zbl 0454.18011)] and Z. Esik [“Identities in iterative and rational algebraic theories”, Comput. Linguist. Comput. Lang. 14, 183–207 (1980; Zbl 0466.68010)]. Examples of iteration theories are the theories of order-preserving functions over complete partially ordered sets, which are equipped with the operation of least fixed-point as dagger.
A specific subclass of partial iteration theories make partial iterative theories, in which the condition on the existence of a dagger operation is replaced by the requirement of satisfaction of certain fixed-point equations. In the manuscript, the authors provide a sufficient condition, when a partial iterative theory gives rise to an iteration theory, i.e., when a partially defined dagger operation can be extended to a totally defined one, which, moreover, satisfies the identities of the induced operation. The obtained result incorporates several of the already existing extension theorems in the literature, e.g., the matrix extension theorem of S. Bloom and Z. Ésik [Iteration theories. The equational logic of iterative processes. EATCS Monographs on Theoretical Computer Science. Berlin: Springer- Verlag (1993; Zbl 0773.03033)] as well as the grove extension theorem of S. L. Bloom and Z. Ésik [“An extension theorem with an application to formal tree series”, J. Autom. Lang. Comb. 8, No. 2, 145–185 (2003; Zbl 1089.68051)], where grove theories are those Lawvere theories \(T\), which have an additive structure on their hom-sets (unlike the classical case of additive categories of, e.g., H. Herrlich and G. E. Strecker [Category theory. An introduction. 3rd ed., Sigma Series in Pure Mathematics 1. Lemgo: Heldermann Verlag (2007; Zbl 1125.18300)], composition distributes over sums on one side only).
The manuscript essentially consists of the proof of the above-mentioned dagger extension theorem (Theorem 4.4 on page 1044), its corollaries (in which the sufficient extension condition is restated in a different language), and several its applications, which eventually show the inclusion of the aforesaid two extension theorems in the current more general setting.
The language of the paper is quite technical. On the other hand, once the notations are got through, the rest is easy to follow, the paper being conveniently self-contained.

MSC:

18C10 Theories (e.g., algebraic theories), structure, and semantics
18A30 Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.)
15B33 Matrices over special rings (quaternions, finite fields, etc.)
16Y60 Semirings
05C05 Trees
68Q60 Specification and verification (program logics, model checking, etc.)
68Q55 Semantics in the theory of computing
Full Text: DOI

References:

[1] Ésik, J. Autom. Lang. Comb. 8 pp 219– (2003)
[2] Fokkink, Introduction to Process Algebra (2007)
[3] DOI: 10.1006/inco.1998.2746 · Zbl 0924.68143 · doi:10.1006/inco.1998.2746
[4] DOI: 10.1016/S0022-0000(77)80015-9 · Zbl 0358.68072 · doi:10.1016/S0022-0000(77)80015-9
[5] DOI: 10.1016/S0304-3975(96)00240-X · Zbl 0901.68107 · doi:10.1016/S0304-3975(96)00240-X
[6] DOI: 10.1016/j.ic.2009.02.003 · Zbl 1167.68036 · doi:10.1016/j.ic.2009.02.003
[7] Ésik, Computational Linguistics and Computer Languages XV pp 95– (1982)
[8] Bloom, J. of Automata, Languages and Combinatorics 8 pp 145– (2003)
[9] Ésik, Computational Linguistics and Computer Languages XIV pp 183– (1980)
[10] Bloom, Iteration Theories (1993) · doi:10.1007/978-3-642-78034-9
[11] Elgot, Logic Colloquium ’73 pp 175– (1973)
[12] DOI: 10.1137/0209039 · Zbl 0461.68047 · doi:10.1137/0209039
[13] Bloom, SIAM J. Computing 9 pp 26– (1980)
[14] Bekić, Springer-Verlag Lecture Notes in Computer Science 177 pp 30– (1984) · doi:10.1007/BFb0048939
[15] DOI: 10.1109/SFCS.1976.24 · doi:10.1109/SFCS.1976.24
[16] Simpson, 15th Annual IEEE Symposium on Logic in Computer Science (Santa Barbara, CA, 2000) pp 30– (2000)
[17] Park, Machine Intelligence 5 pp 59– (1970)
[18] Niwinski, Springer-Verlag Lecture Notes in Computer Science 226 pp 464– (1986) · doi:10.1007/3-540-16761-7_96
[19] Niwinski, Springer-Verlag Lecture Notes in Computer Science 208 pp 169– (1985) · doi:10.1007/3-540-16066-3_16
[20] DOI: 10.1073/pnas.50.5.869 · Zbl 0119.25901 · doi:10.1073/pnas.50.5.869
[21] Golan, Semirings and Their Applications (1999) · doi:10.1007/978-94-015-9333-5
[22] DOI: 10.1016/0021-8693(76)90106-X · Zbl 0361.18004 · doi:10.1016/0021-8693(76)90106-X
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.