The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteration in conjunction with horizontal and vertical composition in all algebraically complete categories. We give a concrete representation of the free iteration 2-theory generated by a 2-signature
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra ...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
We prove the following completeness theorem: If the fixed point operation over a category is defined...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
AbstractThis paper extends Part 1 of the paper with the same title. Here, matricial iteration theori...
All known structures involving a constructively obtainable fixed point (or it-eration) operation sat...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
AbstractThe (in)equational properties of iteration, i.e., least (pre-)fixed point solutions over cpo...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operato...
International audienceIn the early seventies, Shelah proposed a model-theoretic construction, nowada...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra ...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
We prove the following completeness theorem: If the fixed point operation over a category is defined...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
AbstractThis paper extends Part 1 of the paper with the same title. Here, matricial iteration theori...
All known structures involving a constructively obtainable fixed point (or it-eration) operation sat...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
AbstractThe (in)equational properties of iteration, i.e., least (pre-)fixed point solutions over cpo...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operato...
International audienceIn the early seventies, Shelah proposed a model-theoretic construction, nowada...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra ...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
DOI
Add to ORKG