in this paper we study the relation between module amenability of θ - lau product a×θb and that of banach algebras a, b. we also discuss module biprojectivity of a×θb. as a consequent we will see that for an inverse semigroup s, l 1 (s) ×θ l 1 (s) is module amenable if and only if s is amenable.

The paper deals with special types of $L$-ordered sets, $L$-fuzzy complete lattices, and fuzzy directed complete posets.First, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $L$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $L$-fuzzy complete lattice $(P;e)$, then the least fixpoint of $f$ is meet of a spe...

In order to evaluate repairability (i.e., repair time and cost, etc.), it is necessary estimate the amount of labor (person-day) for caused by seismic damage. The purpose this study obtain fundamental information establishing relation model between L per unit floor area inter-story drift angle R L-R model). We analyze effects structural non-structural components failure mode members, on relatio...

We investigate the Luminosity – Metallicity (L − Z) relation in the local universe (0 < z < 0.15) using spectra of 6 387 star-forming galaxies extracted from the 2dF Galaxy Redshift Survey. This sample is by far the largest to date used to perform such a study. We distinguish star-forming galaxies from AGNs using “standard” diagnostic diagrams to build a homogeneous sample of starburst galaxies...

0 # can be invisibly class generic. 1. Introduction Roughly, the main theorem of this paper is that some instances of any type of non-constructible object are class generic over L, in one sense. Since small large cardinal properties are inherited in L, let us begin by considering the sense in which 0 # can be generic. It is well known that 0 # is not set generic over L, or, indeed, over any inn...

Formal concept analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies concept lattices from binary relations. Given a nonempty finite set A of binary attributes, one obtains a maximal binary relation R based on a relation schema S(A). Firstly, we analyze concepts in R and the concept lattice L(R), and there are some important results as follows: for any two con...

In this paper, we define a kind of lattice-valued convergence spaces based on the notion of $top$-filters, namely $top$-convergence spaces, and show the category of $top$-convergence spaces is Cartesian-closed. Further, in the lattice valued context of a complete $MV$-algebra, a close relation between the category of$top$-convergence spaces and that of strong $L$-topological spaces is establish...

In this paper, we consider the problem of solving systems of fuzzy relation equations in a space with fuzzy preorder. Two types of these systems with different compositions are considered. New solvability criteria are proposed for systems of both types. The new criteria are weaker than all the known ones that are based on the assumption that fuzzy sets on the left-hand side of a system establis...