AbstractA strengthened form of the fixed point property for posets is presented, in which isotone functions are replaced by more general isotone relations. For finite posets, this ‘relational fixed point property’ turns out to be equivalent to dismantlability. But an example shows that not every infinite poset with the relational fixed point property is dismantlable. Applications to quotients and direct products are given
summary:In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as...
Abstract. We prove an analog of a lemma by Mal’tsev and deduce the following analog of a result of R...
AbstractFor any poset P let J(P) denote the complete lattice of order ideals in P. J(P) is a contrav...
AbstractA strengthened form of the fixed point property for posets is presented, in which isotone fu...
AbstractWe propose a new approach towards proving that the fixed point property for ordered sets is ...
A known theorem of R.M. Dacic [Common fixed points and fixed edges for monotone mappings in posets, ...
AbstractIt has been an open problem to characterize posets P with the property that every order-pres...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
AbstractThis work extends to dismantable graphs many properties of dismantable posets dealing with p...
We establish common fixed point theorems for a family of isotone selfmaps of a poset by generalizing...
AbstractThis survey exhibits various algorithms to decide the question if a given ordered set P has ...
AbstractNecessary and sufficient conditions for a finite poset and a finite distributive lattice to ...
AbstractGiven two finite posetsPandP′ with the same comparability graph, we show that if |V(P)|⩾4 an...
Given a non-empty strictly inductive poset X, that is, a non-empty partially ordered set such that e...
AbstractA characterization is given for those posets (X, ⩽) such that X admits exactly one topology ...
summary:In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as...
Abstract. We prove an analog of a lemma by Mal’tsev and deduce the following analog of a result of R...
AbstractFor any poset P let J(P) denote the complete lattice of order ideals in P. J(P) is a contrav...
AbstractA strengthened form of the fixed point property for posets is presented, in which isotone fu...
AbstractWe propose a new approach towards proving that the fixed point property for ordered sets is ...
A known theorem of R.M. Dacic [Common fixed points and fixed edges for monotone mappings in posets, ...
AbstractIt has been an open problem to characterize posets P with the property that every order-pres...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
AbstractThis work extends to dismantable graphs many properties of dismantable posets dealing with p...
We establish common fixed point theorems for a family of isotone selfmaps of a poset by generalizing...
AbstractThis survey exhibits various algorithms to decide the question if a given ordered set P has ...
AbstractNecessary and sufficient conditions for a finite poset and a finite distributive lattice to ...
AbstractGiven two finite posetsPandP′ with the same comparability graph, we show that if |V(P)|⩾4 an...
Given a non-empty strictly inductive poset X, that is, a non-empty partially ordered set such that e...
AbstractA characterization is given for those posets (X, ⩽) such that X admits exactly one topology ...
summary:In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as...
Abstract. We prove an analog of a lemma by Mal’tsev and deduce the following analog of a result of R...
AbstractFor any poset P let J(P) denote the complete lattice of order ideals in P. J(P) is a contrav...