in this paper, countable compactness and the lindel¨of propertyare defined for l-fuzzy sets, where l is a complete de morgan algebra. theydon’t rely on the structure of the basis lattice l and no distributivity is requiredin l. a fuzzy compact l-set is countably compact and has the lindel¨ofproperty. an l-set having the lindel¨of property is countably compact if andonly if it is fuzzy compact. ...

We introduce the concept of Mσ-approachability for a semicontinuous function (i.e. a nonadditive measure) on a σ-complete sublattice of a locally complete σ-continuous lattice L and using it we extend a nonadditive measure from a sublattice of L to a σ-complete sublattice of L. AMS Mathematics Subject Classification (2000): 28A12, 28C15, 28B10

We study the monoid generalizationMk,1 of the Thompson-Higman groups, and we characterize the Rand the L-preorder ofMk,1. Although Mk,1 has only one non-zero J -class and k−1 non-zero D-classes, the Rand the L-preorder are complicated; in particular, <R is dense (even within an L-class), and <L is dense (even within an R-class). We study the computational complexity of the Rand the L-preorder. ...

Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a language L is complete for the leaf language class defined by L via logspace machines. A more difficult variant of the compressed membership problem for L is shown to be complete for the leaf language class defined by L via ...

We know that there existNP-complete languages. Assuming P 6= NP, any NP-complete language lies in NP \ P. Are there languages that are neither in P nor NP-complete? Ladner’s theorem tells us that there are. As some intuition for Ladner’s theorem, take some language L ∈ NP \ P. Using padding, we will make L “easy enough” so that it can’t be NP-complete, while keeping it “hard enough” so it is no...

In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...

in this note by considering a complete lattice l, we define thenotion of an l-fuzzy hyperrelation on a given non-empty set x. then wedefine the concepts of (pom)l-fuzzy graph, hypergraph and subhypergroupand obtain some related results. in particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (pom)l-fuzzy subhypergroups ...

The aim of this work is the formalization of Chapter 0 Section 4 of [11]. In this paper the definition of meet-continuous lattices is introduced. Theorem 4.2 and Remark 4.3 are proved. Let X, Y be non empty sets, let f be a function from X into Y , and let Z be a non empty subset of X. One can verify that f • Z is non empty. Let us note that every non empty relational structure which is reflexi...

in this paper, for a complete lattice l, we introduce interval-valued l-fuzzy ideal (prime ideal) of a near-ring which is an extended notion of fuzzy ideal (prime ideal) of a near-ring. some characterization and properties are discussed.

scour around bridge piers is one of the most important fields of hydraulic research. local scour around bridge piers and abutment is one of the main reasons of bridge failures. in the field of scour at the bridges, researches are more focus on scour of piers in compare with abutment. while the available information on the bridge failures required cost, the major problems are related to abutment...