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

S. Parameshwara Bhatta

Displaying similar documents to “Weak chain-completeness and fixed point property for pseudo-ordered sets”

Some characterizations of completeness for trellises in terms of joins of cycles

S. Parameshwara Bhatta, H. Shashirekha (2004)

Czechoslovak Mathematical Journal

Similarity:

This paper gives some new characterizations of completeness for trellises by introducing the notion of a cycle-complete trellis. One of our results yields, in particular, a characterization of completeness for trellises of finite length due to K. Gladstien (see K. Gladstien: Characterization of completeness for trellises of finite length, Algebra Universalis 3 (1973), 341–344).

Fixed point characterization of completeness on lattices for relatively isotone mappings

Jiří Klimeš (1984)

Archivum Mathematicum

Similarity:

On fixed points of maximalizing mappings in posets.

Heikkilä, S. (2010)

Fixed Point Theory and Applications [electronic only]

Similarity:

Note on normal sequences of chain complexes

Klaus Heiner Kamps (1978)

Colloquium Mathematicae

Similarity:

On strong chain recurrence for maps

Katsuya Yokoi (2015)

Annales Polonici Mathematici

Similarity:

This paper is concerned with strong chain recurrence introduced by Easton. We investigate the depth of the transfinite sequence of nested, closed invariant sets obtained by iterating the process of taking strong chain recurrent points, which is a related form of the central sequence due to Birkhoff. We also note the existence of a Lyapunov function which is decreasing off the strong chain recurrent set. As an application, we give a necessary and sufficient condition for the coincidence...

Finiteness and compactness in chain-net spaces

D. W. Hajek, R. G. Wilson (1982)

Matematički Vesnik

Similarity: