Weak chain-completeness and fixed point property for pseudo-ordered sets
Czechoslovak Mathematical Journal, Tome 55 (2005) no. 2, pp. 365-369
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as an extension of the notion of chain-completeness of posets (see [3]) and it is shown that every isotone map of a weakly chain-complete pseudo-ordered set into itself has a least fixed point.
In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as an extension of the notion of chain-completeness of posets (see [3]) and it is shown that every isotone map of a weakly chain-complete pseudo-ordered set into itself has a least fixed point.
Classification :
06B05
Keywords: pseudo-ordered set; trellis; complete trellis; fixed point property; weak chain completeness
Keywords: pseudo-ordered set; trellis; complete trellis; fixed point property; weak chain completeness
@article{CMJ_2005_55_2_a6,
author = {Bhatta, S. Parameshwara},
title = {Weak chain-completeness and fixed point property for pseudo-ordered sets},
journal = {Czechoslovak Mathematical Journal},
pages = {365--369},
year = {2005},
volume = {55},
number = {2},
mrnumber = {2137143},
zbl = {1081.06004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2005_55_2_a6/}
}
Bhatta, S. Parameshwara. Weak chain-completeness and fixed point property for pseudo-ordered sets. Czechoslovak Mathematical Journal, Tome 55 (2005) no. 2, pp. 365-369. http://geodesic.mathdoc.fr/item/CMJ_2005_55_2_a6/