In this paper, we introduce a new concept on a complete partially ordered Dmetric space by using the concept of D-metric space it's called ∇ -distance which is a generalized of the concept of a w-distance. The main result of our paper is prove some fixed point theorems in complete partially ordered D-metric space. Mathematics Subject Classification: 47H10, 54H25

We study chains in an H-closed topological partially ordered space. We give sufficient conditions for a maximal chain L in an H-closed topological partially ordered space such that L contains a maximal (minimal) element. Also we give sufficient conditions for a linearly ordered topological partially ordered space to be H-closed. We prove that any H-closed topological semilattice contains a zero...

In this paper, some recent results established by Marin Borcut [M. Borcut, Tripled fixed point theorems for monotone mappings in partially ordered metric spaces, Carpathian J. Math. 28, 2 (2012), 207--214] and [M. Borcut, Tripled coincidence theorems for monotone mappings in partially ordered metric spaces, Creat. Math. Inform. 21, 2 (2012), 135--142] are generalized and improved, with much sho...

Only the usual axioms of set theory are needed to prove the existence of a Baire space whose square is not a Baire space. Assuming the continuum hypothesis (CH), Oxtoby [9] constructed a Baire space whose square is not Baire. We will show in this paper that the assumption of CH is unnecessary. Such results are greatly enhanced by Krom [5], who showed that if there is such an example, then there...

We present a construction which shows that the Tiordered reflection (i ∈ {0, 1, 2}) of a partially ordered topological space (X, τ,≤) exists and is an ordered quotient of (X, τ,≤). We give an explicit construction of the T0-ordered reflection of an ordered topological space (X, τ,≤), and characterize ordered topological spaces whose T0-ordered reflection is T1-ordered. 2000 AMS Classification: ...

We describe a novel heuristic search algorithm, called Sweep A*, that exploits the regular structure of partially ordered graphs to substantially reduce the memory requirements of search. We show that it outperforms previous search algorithms in optimally aligning multiple protein or DNA sequences, an important problem in bioinformatics. Sweep A* also promises to be effective for other search p...