Fixed point characterization of completeness on lattices for relatively isotone mappings

Jiří Klimeš

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Fixed point characterization of completeness on lattices for relatively isotone mappings”

A characterization of inductive posets

Jiří Klimeš (1985)

Archivum Mathematicum

Similarity:

On fixed points of maximalizing mappings in posets.

Heikkilä, S. (2010)

Fixed Point Theory and Applications [electronic only]

Similarity:

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

S. Parameshwara Bhatta (2005)

Czechoslovak Mathematical Journal

Similarity:

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.

Embeddings of chains into chains

Vítězslav Novák, Tomáš Novotný (2005)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Continuity of isotone mappings and embeddings of a chain G into another chain are studied. Especially, conditions are found under which the set of points of discontinuity of such a mapping is dense in G.