Displaying similar documents to “Fixpoint Theorem for Continuous Functions on Chain-Complete Posets”

Effective chain complexes for twisted products

Marek Filakovský (2012)

Archivum Mathematicum

Similarity:

In the paper weak sufficient conditions for the reduction of the chain complex of a twisted cartesian product F × τ B to a chain complex of free finitely generated abelian groups are found.

Definition of Flat Poset and Existence Theorems for Recursive Call

Kazuhisa Ishida, Yasunari Shidama, Adam Grabowski (2014)

Formalized Mathematics

Similarity:

This text includes the definition and basic notions of product of posets, chain-complete and flat posets, flattening operation, and the existence theorems of recursive call using the flattening operator. First part of the article, devoted to product and flat posets has a purely mathematical quality. Definition 3 allows to construct a flat poset from arbitrary non-empty set [12] in order to provide formal apparatus which eanbles to work with recursive calls within the Mizar langauge....

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

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.