Given is an ordered set in which every chain has an upper bound and every pair of elements has a greatest lower bound. Let Z be its set of maximal elements and let F be a function from Z to Z. A condition is presented that implies that F has a unique fixpoint. This is a generalization of a theorem of Naundorf. In Naundorf's theorem, the condition is related to causality for behaviour that develops in time.
Given a non-empty strictly inductive poset X, that is, a non-empty partially ordered set such that e...
[[abstract]]In this paper, using a generalization of the Fan–Browder fixed point theorem, we obtain ...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
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...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotonefunction over a complete...
AbstractThe denotational semantics of a deterministic timed system can be described by a function F:...
Least fixpoints of monotone functions are an important concept in computer science which can be gene...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
AbstractWe unveil new results based on measurement that guarantee the existence of unique fixed poin...
We present a proof of Arrow's theorem from social choice theory that uses a fixpoint argument. Speci...
For a finite ground set X, this paper investigates properties of the set of orders with the fixed po...
The basic Zermelo-Bourbaki fixed point principle is being enlarged from a technical viewpoint. Some ...
summary:A constructively valid counterpart to Bourbaki's Fixpoint Lemma for chain-complete partially...
We use chain methods to prove fixed point results for maximalizing mappings in posets. Concrete exa...
Given a non-empty strictly inductive poset X, that is, a non-empty partially ordered set such that e...
[[abstract]]In this paper, using a generalization of the Fan–Browder fixed point theorem, we obtain ...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
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...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotonefunction over a complete...
AbstractThe denotational semantics of a deterministic timed system can be described by a function F:...
Least fixpoints of monotone functions are an important concept in computer science which can be gene...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
AbstractWe unveil new results based on measurement that guarantee the existence of unique fixed poin...
We present a proof of Arrow's theorem from social choice theory that uses a fixpoint argument. Speci...
For a finite ground set X, this paper investigates properties of the set of orders with the fixed po...
The basic Zermelo-Bourbaki fixed point principle is being enlarged from a technical viewpoint. Some ...
summary:A constructively valid counterpart to Bourbaki's Fixpoint Lemma for chain-complete partially...
We use chain methods to prove fixed point results for maximalizing mappings in posets. Concrete exa...
Given a non-empty strictly inductive poset X, that is, a non-empty partially ordered set such that e...
[[abstract]]In this paper, using a generalization of the Fan–Browder fixed point theorem, we obtain ...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
DOI
Add to ORKG