in this paper we define weak $f$-contractions on a‎ ‎metric space into itself by extending $f$-contractions‎ ‎introduced by d‎. ‎wardowski (2012) and provide some fixed point‎ ‎results in complete metric spaces and in partially ordered complete ‎generalized metric spaces‎. ‎some relationships between weak‎ ‎$f$-contractions and $fi$-contractions are highlighted‎. ‎we also ‎give some application...

This set of notes is prepared for the Meander Group (MG) at Brigham Young University. Its purpose is to introduce MG to: (1) the basic definitions and theorems of partially ordered set theory and (2) the various combinatorial methods associated with partially ordered sets.

The concept of L-fuzzy lattice is presented by means of an L-fuzzy partially ordered set. An L-fuzzy partially ordered set A is an L-fuzzy lattice if and only if one of A[a], A([a]), and A(a) is a lattice.

We consider the concept of Ω-distance on a complete partially ordered G-metric space and prove some common fixed point theorems.

Given a mapping f : A → B from a partially ordered set A into an unstructured set B, we study the problem of defining a suitable partial ordering relation on B such that there exists a mapping g : B → A such that the pair of mappings (f, g) forms an isotone Galois connection between partially ordered sets.

In this paper we will show that partially ordered monads contain sufficient structure for modelling monadic topologies, rough sets and Kleene algebras. Convergence represented by extension structures over partially ordered monads includes notions of regularity and compactness. A compactification theory can be developed. Rough sets [23] are modelled in a generalized setting with set functors. Fu...

This paper deals with iterated revision of partially ordered information. The first part of this paper concerns the Katsuno-Mendelzon’s postulates: we first point out that these postulates are not fully satisfactory since only a class of partially ordered information can be revised. We then propose a suitable definition of faithful assignment, followed by a new set of postulates and a represent...

A poset is said to be ω-chain complete if every countable chain in it has a least upper bound. It is known that every partially ordered set has a natural ω-completion. In this paper we study the ω-completion of partially ordered semigroups, and the topological action of such a semigroup on its ω-completion. We show that, for partially ordered semigroups, ω-completion and quotient with respect t...

In this paper, author proves the algorithms for the existence as well as the approximation of solutions to a couple of periodic boundary value problems of nonlinear first order ordinary integro-differential equations using operator theoretic techniques in a partially ordered metric space. The main results rely on the Dhage iteration method embodied in the recent hybrid fixed point theorems of D...

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.