AbstractWe prove the following completeness theorem: If the fixed point operation over a category is defined by initiality, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
Abstract. Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-t...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
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...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operato...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
AbstractThe (in)equational properties of iteration, i.e., least (pre-)fixed point solutions over cpo...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
All known structures involving a constructively obtainable fixed point (or it-eration) operation sat...
The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteratio...
International audienceWe study the logical properties of the (parametric) well-founded fixed point o...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
AbstractThis paper is concerned with the equational logic of corecursion, that is of definitions inv...
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
Abstract. Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-t...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
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...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operato...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
AbstractThe (in)equational properties of iteration, i.e., least (pre-)fixed point solutions over cpo...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
All known structures involving a constructively obtainable fixed point (or it-eration) operation sat...
The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteratio...
International audienceWe study the logical properties of the (parametric) well-founded fixed point o...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
AbstractThis paper is concerned with the equational logic of corecursion, that is of definitions inv...
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
Abstract. Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-t...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
DOI
Add to ORKG