AbstractAfter a simple and convenient generalization of the notion of continuous functions and continuous lattices we answer the following question: when for a given element x of a complete lattice there is a least continuous function having x as a least fixed point? The minimal continuous functions having x as a least fixed point are characterized through a correspondence with maximal ascending sequences converging to x
We describe a common extension of the fundamental theorem of Linear Programming on the existence of ...
A fixed point of a function f from a set X into itself is a point x0 satisfying f(x0) = x0. Theorem...
The basic definitions are given in the first section, including those for ω-chain continuity, ω-chai...
AbstractAfter a simple and convenient generalization of the notion of continuous functions and conti...
I. Introduction. A partially ordered set P is co-chain complete if every countable chain (including ...
A partially ordered set P is ω-chain complete if every countable chain (including the empty set) in ...
Assume a partially ordered set (S,<=) and a relation R on S. We consider various sets of conditions ...
In this note we prove that on metric measure spaces, functions of least gradient, as well as local m...
Assume a partially ordered set (S,<=) and a relation R on S. We consider various sets of conditions ...
We generalize a known result of A. Petrusel [Multivalued weakly Picard operators and applications, S...
Abstract. We prove that in a complete partially ordered set, every commutative family of decreasing ...
AbstractIt is shown that the least fixed point and greatest fixed point operations of an increasing ...
Least fixpoints of monotone functions are an important concept in computer science which can be gene...
The existence of minimizers is examined for a function defined on a metric space. Theorems are prove...
International audienceIt is shown that the least fixed point and greatest fixed point operations of ...
We describe a common extension of the fundamental theorem of Linear Programming on the existence of ...
A fixed point of a function f from a set X into itself is a point x0 satisfying f(x0) = x0. Theorem...
The basic definitions are given in the first section, including those for ω-chain continuity, ω-chai...
AbstractAfter a simple and convenient generalization of the notion of continuous functions and conti...
I. Introduction. A partially ordered set P is co-chain complete if every countable chain (including ...
A partially ordered set P is ω-chain complete if every countable chain (including the empty set) in ...
Assume a partially ordered set (S,<=) and a relation R on S. We consider various sets of conditions ...
In this note we prove that on metric measure spaces, functions of least gradient, as well as local m...
Assume a partially ordered set (S,<=) and a relation R on S. We consider various sets of conditions ...
We generalize a known result of A. Petrusel [Multivalued weakly Picard operators and applications, S...
Abstract. We prove that in a complete partially ordered set, every commutative family of decreasing ...
AbstractIt is shown that the least fixed point and greatest fixed point operations of an increasing ...
Least fixpoints of monotone functions are an important concept in computer science which can be gene...
The existence of minimizers is examined for a function defined on a metric space. Theorems are prove...
International audienceIt is shown that the least fixed point and greatest fixed point operations of ...
We describe a common extension of the fundamental theorem of Linear Programming on the existence of ...
A fixed point of a function f from a set X into itself is a point x0 satisfying f(x0) = x0. Theorem...
The basic definitions are given in the first section, including those for ω-chain continuity, ω-chai...
DOI
Add to ORKG