All known structures involving a constructively obtainable fixed point (or it-eration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be a general equational theory of iteration. This paper provides evidence that there is no general implicational theory of iteration. In particular, the quasi-variety generated by the continuous ordered theories, in which fixed point equations have least solutions, is incomparable with the quasi-variety generated by the pointed iterative theories, in which fixed point equations have unique solutions
International audienceWell-founded fixed points have been used in several areas of knowledge represe...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...
“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...
AbstractThe (in)equational properties of iteration, i.e., least (pre-)fixed point solutions over cpo...
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...
International audienceWe study the logical properties of the (parametric) well-founded fixed point o...
AbstractWe introduce the notion of a general fixed point iteration scheme to unify various fixed poi...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
We present here lesson plans for teaching the dynamical systems topic of iteration of functions and ...
The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteratio...
AbstractThis paper is concerned with the equational logic of corecursion, that is of definitions inv...
International audienceWell-founded fixed points have been used in several areas of knowledge represe...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...
“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...
AbstractThe (in)equational properties of iteration, i.e., least (pre-)fixed point solutions over cpo...
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...
International audienceWe study the logical properties of the (parametric) well-founded fixed point o...
AbstractWe introduce the notion of a general fixed point iteration scheme to unify various fixed poi...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
We present here lesson plans for teaching the dynamical systems topic of iteration of functions and ...
The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteratio...
AbstractThis paper is concerned with the equational logic of corecursion, that is of definitions inv...
International audienceWell-founded fixed points have been used in several areas of knowledge represe...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...