in this paper, the definition of meet-continuity on $l$-directedcomplete posets (for short, $l$-dcpos) is introduced. as ageneralization of meet-continuity on crisp dcpos, meet-continuity on$l$-dcpos, based on the generalized scott topology, ischaracterized. in particular, it is shown that every continuous$l$-dcpo is meet-continuous and $l$-continuous retracts ofmeet-continuous $l$-dcpos are al...

an efficient flood alarm system may significantly improve public safety and mitigate damages caused by inundation. flood forecasting is undoubtedly a challenging field of operational hydrology and a huge literature has been developed over the years. in this paper, we first define ordered ideal intuitionistic fuzzy sets and establish some results on them. then, we define similarity measures betw...

in this note we point out and rectify some errors in a recently published paper “n. singh, r. jain: coupled fixed point results for weakly related mappings in partially ordered metric spaces, bull. iranian math. soc. 40 (2014), no. 1, 29-40”.

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.

The concept of defining set has been studied in block designs and, under the name critical sets, in Latin squares and Room squares. Here we study defining sets for directed designs. A t-(v, k,'x) directed design (DD) is a pair (V, B), where V is a v-set and B is a collection of ordered blocks (or k-tuples of V), for which each t-tuple of V appears in precisely ,X blocks. A set of blocks which i...

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