Chains in modular ternary latticoids

Jarmila Hedlíková

Displaying similar documents to “Chains in modular ternary latticoids”

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

Note on normal sequences of chain complexes

Klaus Heiner Kamps (1978)

Colloquium Mathematicae

Similarity:

Maximal chains and antichains

P. Grillet (1969)

Fundamenta Mathematicae

Similarity:

Modular ordered sets

Milan Kolibiar (1994)

Mathematica Slovaca

Similarity:

Set families with a forbidden subposet.

Bukh, Boris (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Another proof that a chain of non-empty H-closed subspaces has a non-empty intersection

J. Mioduszewski (1971)

Colloquium Mathematicae

Similarity:

On The Use Of Structural Formulae Of Kinematic Chains

Marko D. Lekop (1973)

Publications de l'Institut Mathématique

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.