Least fixpoints of monotone functions are an important concept in computer science which can be generalised to inflationary fixpoints of arbitrary functions. This raises questions after the expressive power of these two concepts, in particular whether the latter can be expressed as the former in certain circumstances. We show that the inflationary fixpoint of an arbitrary function on a lattice of finite height can be expressed as the least fixpoint of a monotone function on an associated function lattice
This paper continues investigations of the monotone fixed point principle in the context of Feferman...
We present a practical algorithm for computing least solutions of systems of (fixpoint-)equations ov...
In the context of abstract interpretation for languages without higher-order features we study the n...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotonefunction over a complete...
AbstractWe study the relationship between least and inflationary fixed-point logic. In 1986, Gurevic...
Abstract We study the relationship between least and inflationaryfixed-point logic. By results of Gu...
Abstract. We consider an extension of modal logic with an operator for constructing inflationary fix...
AbstractAfter a simple and convenient generalization of the notion of continuous functions and conti...
We present {\em Approximation theory}, an extension of Tarski's least fixpoint theory for nonmonoton...
AbstractGiven is an ordered set in which every chain has an upper bound and every pair of elements h...
Given is an ordered set in which every chain has an upper bound and every pair of elements has a gre...
In the context of abstract interpretation for languages without higher-order features we study the n...
International audienceIt is shown that the least fixed point and greatest fixed point operations of ...
AbstractIt is shown that the least fixed point and greatest fixed point operations of an increasing ...
The context for this paper is Feferman's theory of explicit mathematics, a formal framework ser...
This paper continues investigations of the monotone fixed point principle in the context of Feferman...
We present a practical algorithm for computing least solutions of systems of (fixpoint-)equations ov...
In the context of abstract interpretation for languages without higher-order features we study the n...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotonefunction over a complete...
AbstractWe study the relationship between least and inflationary fixed-point logic. In 1986, Gurevic...
Abstract We study the relationship between least and inflationaryfixed-point logic. By results of Gu...
Abstract. We consider an extension of modal logic with an operator for constructing inflationary fix...
AbstractAfter a simple and convenient generalization of the notion of continuous functions and conti...
We present {\em Approximation theory}, an extension of Tarski's least fixpoint theory for nonmonoton...
AbstractGiven is an ordered set in which every chain has an upper bound and every pair of elements h...
Given is an ordered set in which every chain has an upper bound and every pair of elements has a gre...
In the context of abstract interpretation for languages without higher-order features we study the n...
International audienceIt is shown that the least fixed point and greatest fixed point operations of ...
AbstractIt is shown that the least fixed point and greatest fixed point operations of an increasing ...
The context for this paper is Feferman's theory of explicit mathematics, a formal framework ser...
This paper continues investigations of the monotone fixed point principle in the context of Feferman...
We present a practical algorithm for computing least solutions of systems of (fixpoint-)equations ov...
In the context of abstract interpretation for languages without higher-order features we study the n...