Weak chain-completeness and fixed point property for pseudo-ordered sets

S. Parameshwara Bhatta

Czechoslovak Mathematical Journal (2005)

  • Volume: 55, Issue: 2, page 365-369
  • ISSN: 0011-4642

Abstract

top
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.

How to cite

top

Bhatta, S. Parameshwara. "Weak chain-completeness and fixed point property for pseudo-ordered sets." Czechoslovak Mathematical Journal 55.2 (2005): 365-369. <http://eudml.org/doc/30950>.

@article{Bhatta2005,
abstract = {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.},
author = {Bhatta, S. Parameshwara},
journal = {Czechoslovak Mathematical Journal},
keywords = {pseudo-ordered set; trellis; complete trellis; fixed point property; weak chain completeness; pseudo-ordered set; trellis; complete trellis; fixed-point property; weak chain completeness},
language = {eng},
number = {2},
pages = {365-369},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Weak chain-completeness and fixed point property for pseudo-ordered sets},
url = {http://eudml.org/doc/30950},
volume = {55},
year = {2005},
}

TY - JOUR
AU - Bhatta, S. Parameshwara
TI - Weak chain-completeness and fixed point property for pseudo-ordered sets
JO - Czechoslovak Mathematical Journal
PY - 2005
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 55
IS - 2
SP - 365
EP - 369
AB - 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.
LA - eng
KW - pseudo-ordered set; trellis; complete trellis; fixed point property; weak chain completeness; pseudo-ordered set; trellis; complete trellis; fixed-point property; weak chain completeness
UR - http://eudml.org/doc/30950
ER -

References

top
  1. Algebraic Theory of Lattices, Prentice-Hall, Englewood Cliffs, 1973. (1973) 
  2. 10.2307/2323807, Amer. Math. Monthly 98 (1991), 353–354. (1991) Zbl0749.04002MR1103192DOI10.2307/2323807
  3. Chain-complete posets and directed sets with applications, Algebra Universalis 6 (1976), 54–69. (1976) MR0398913
  4. 10.1007/BF02944982, Algebra Universalis 1 (1971), 218–233. (1971) Zbl0242.06003MR0302523DOI10.1007/BF02944982
  5. Trellis Theory, Mem. Amer. Math. Soc. 121, Providence, 1972. (1972) Zbl0242.06004MR0325474

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.