Abstract. In this paper, we introduce generalized fuzzy weakly interior ideals of an ordered semigroup. We generalize fuzzy interior ideals of an ordered semigroup. We establish necessary and sufficient condition for a fuzzy set to be a generalized fuzzy weakly interior ideal. We establish three equivalent conditions for an ordered semigroup to be regular. We characterize semisimple ordered sem...

The intuitionistic fuzzification of the notion of a bi-ideal in ordered semigroups is considered. In terms of intuitionistic fuzzy set, conditions for an ordered semigroup to be completely regular is provided. Characterizations of intuitionistic fuzzy bi-ideals in ordered semigroups are given. Using a collection of bi-ideals with additional conditions, an intuitionistic fuzzy bi-ideal is constr...

By jagged partitions we refer to an ordered collection of non-negative integers (n 1 , n 2 , · · · , n m) with n m ≥ p for some positive integer p, further subject to some weakly decreasing conditions that prevent them for being genuine partitions. The case analyzed in greater detail here corresponds to p = 1 and the following conditions n i ≥ n i+1 − 1 and n i ≥ n i+2. A number of properties f...

For an anti-congruence q we say that it is regular anti-congruence on semigroup (S,=, =, ·, α) ordered under anti-order α if there exists an antiorder θ on S/q such that the natural epimorphism is a reverse isotone homomorphism of semigroups. Anti-congruence q is regular if there exists a quasi-antiorder σ on S under α such that q = σ ∪ σ−1. Besides, for regular anti-congruence q on S, a constr...

In this paper, we present an accurate numerical approach based on the reproducing kernel method (RKM) for solving second-order fuzzy initial value problems (FIVP) with symmetry coefficients such as symmetric triangles and trapezoids. Finding exact solution of FIVP is not easy task since definition will produce a complicated optimization problem. To overcome difficulty, developed to solve type p...

In this paper we mainly deal with first-order languages without equality and introduce a weak form of equality predicate, the so-called Leibniz equality. This equality is characterized algebraically by means of a natural concept of congruence; in any structure, it turns out to be the maximum congruence of the structure. We show that first-order logic without equality has two distinct complete s...

Compositional generation is an incremental technique for generating a reduced labelled transition system representing the behaviour of a set of communicating processes. In particular, since intermediate reductions can be performed after each generation step, the size of the Lts can be kept small and state-explosion can be avoided in many cases. This paper deals with compositional generation in ...

We show that the poset of regions (with respect to a canonical base region) of a supersolvable hyperplane arrangement is a congruence normal lattice. Specifically, the poset of regions of a supersolvable arrangement of rank k is obtained via a sequence of doublings from the poset of regions of a supersolvable arrangement of rank k − 1. An explicit description of the doublings leads to a proof t...