Results 21 to 30 of about 114 (62)
Some results on ordered filters of implicative semigroups
We introduce a special set in an implicative semigroup. Using it, an equivalent condition of an ordered filter is stated. We prove that an ordered filter can be represented by the union of such sets.
Young Bae Jun
wiley +1 more source
On ideals of implicative semigroups
We introduce the notion of ideals in implicative semigroups, and then state the characterizations of the ideals.
Young Bae Jun, Kyung Ho Kim
wiley +1 more source
A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application
We obtain a fixed point theorem for a type of generalized contractions on preordered complete fuzzy quasi-metric spaces which is applied to deduce, among other results, a procedure to show in a direct and easy fashion the existence of solution for the ...
Francisco Castro-Company +2 more
semanticscholar +2 more sources
Antichains of a finite bounded poset are assigned antichains playing a role analogous to that played by blockers in the Boolean lattice of all subsets of a finite set. Some properties of lattices of generalized blockers are discussed.
Andrey O. Matveev
wiley +1 more source
Positive implicative ordered filters of implicative semigroups
We introduce the notion of positive implicative ordered filters in implicative semigroups. We show that every positive implicative ordered filter is both an ordered filter and an implicative ordered filter. We give examples that an ordered filter (an implicative ordered filter) may not be a positive implicative ordered filter.
Young Bae Jun, Kyung Ho Kim
wiley +1 more source
Sharp partial closure operator
As an improvement of existing relationships among collections of sets, closure operators and posets, a particular, so called sharp partial closure operator (SPCO) is introduced.
B. Seselja +2 more
semanticscholar +1 more source
On chains and posets within the power set of a continuum
Transfinite induction is employed to construct a copy of an arbitrary partially‐ordered set of cardinality at most c within the power set (quasi‐ordered by sub‐chain embeddability) of the real line.
P. T. Matthews, T. B. M. McMaster
wiley +1 more source
In this paper, we introduce the concepts of preordered Banach spaces, generalized saddle points and preordered variational inequalities. Then we apply the order-clustered fixed point theorems to prove the existence of solutions to these problems.
Linsen Xie, Jinlu Li, Wenshan Yang
semanticscholar +2 more sources
The concept of graph labeling was introduced in the mid-1960s by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown.
Bhavale An, Shelke Ds
semanticscholar +1 more source
General complementarities on complete partial orders
This paper proves the existence of a Nash equilibrium for extended (semi-) uniformg-modular games, i.e., non-cooperative games where the strategy space is a complete partially ordered set, and the best reply correspondence satisfies certain monotonicity ...
Kerim Keskin +2 more
semanticscholar +2 more sources

