The aim of this paper is to extend the truth value table oflattice-valued convergence spaces to a more general case andthen to use it to introduce and study the quantale-valued fuzzy Scotttopology in fuzzy domain theory. Let $(L,*,varepsilon)$ be acommutative unital quantale and let $otimes$ be a binary operationon $L$ which is distributive over nonempty subsets. The quadruple$(L,*,otimes,varep...

(1) For every sup-semilattice L and for all elements x, y of L holds d−eL(↑x∩↑y) = xt y. (2) For every semilattice L and for all elements x, y of L holds ⊔ L(↓x∩↓y) = xu y. (3) Let L be a non empty relational structure and x, y be elements of L. If x is maximal in (the carrier of L)\↑y, then ↑x\{x}= ↑x∩↑y. (4) Let L be a non empty relational structure and x, y be elements of L. If x is minimal ...

Given a linear equation L, a set A ⊆ [n] is L-free if A does not contain any ‘non-trivial’ solutions to L. In this paper we consider the following three general questions: (i) What is the size of the largest L-free subset of [n]? (ii) How many L-free subsets of [n] are there? (iii) How many maximal L-free subsets of [n] are there? We completely resolve (i) in the case when L is the equation px ...

The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...

‎for a set of non-negative integers~$l$‎, ‎the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$‎. ‎the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

We compare the monadic second-order theory of an arbitrary linear ordering L with the theory of the family of subsets of L endowed with the operation on subsets obtained by lifting the max operation on L. We show that the two theories define the same relations. The same result holds when lifting the min operation or both max and min operations.

Crisp and L-fuzzy ambiguous representations of closed subsets of one space by closed subsets of another space are introduced. It is shown that, for each pair of compact Hausdorff spaces, the set of (crisp or L-fuzzy) ambiguous representations is a lattice and a compact Hausdorff Lawson upper semilattice. The categories of ambiguous and L-ambiguous representations are defined and investigated.

A theorem of Sperner [2] states that a collection of subsets of (l,..., n), no two ordered by inclusion, contains at most ( &,) sets. How many twoelement chains A cB of subsets of {I,..., n} can be found such that sets in different chains are not related? More generally, we seek to determinef,(n), defined to be the maximum m such that there exist subsets A(i,j) 5 {l,..., n}, 1 < i < m, 0 <j < k...