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. ...

My talk is based on article [1]. Our aim is to give a unified topological approach to several results about a certain type of fuzzy measures, namely T∞−valuations (2) on clans of fuzzy sets (1) (in the sense of Butnariu and Klement [2]). We will transfer the method of [3], used to study FN-topologies (4) and measures on Boolean rings, to the study of T∞−valuations. So we need, for the domain of...

let $mathfrak{l}$ be the virasoro-like algebra and $mathfrak{g}$ itsderived algebra, respectively. we investigate the structure of the lie triplederivation algebra of $mathfrak{l}$ and $mathfrak{g}$. we provethat they are both isomorphic to $mathfrak{l}$, which provides twoexamples of invariance under triple derivation.

Interval-valued fuzzy sets are based on the algebra of subintervals of the unit interval [0, 1]. We study valuations as a special type of measures on this algebra. We present a description of all valuations which preserve the standard fuzzy negation and extend the identity on the elements of the form (x, x). Consequences for sublattices are formulated. Keywords— Girard algebra, interval-valued ...

In this paper, we investigate the many-valued version of coalgebraic modal logic through predicate lifting approach. Coalgebras, understood as generic transition systems, can serve semantic structures for various kinds logics. A well-known result in is that its completeness be determined at one-step level. We generalize to finitely case by using canonical model construction. prove logics based ...

We extend the notion of Heyting algebra to a notion of truth values algebra and prove that a theory is consistent if and only if it has a B-valued model for some non trivial truth values algebra B. A theory that has a B-valued model for all truth values algebras B is said to be super-consistent. We prove that super-consistency is a model-theoretic sufficient condition for strong normalization.

A game on a convex geometry is a real-valued function de0ned on the family L of the closed sets of a closure operator which satis0es the 0nite Minkowski–Krein–Milman property. If L is the boolean algebra 2 then we obtain an n-person cooperative game. Faigle and Kern investigated games where L is the distributive lattice of the order ideals of the poset of players. We obtain two classes of axiom...

Residuated structures are important lattice-ordered algebras both for mathematics and for logics; in particular, the development of lattice-valued mathematics and related non-classical logics is based on a multitude of lattice-ordered structures that suit for many-valued reasoning under uncertainty and vagueness. Extended-order algebras, introduced in [10] and further developed in [1], give an ...

Let $(X,d)$ be a compactmetric space and let $K$ be a nonempty compact subset of $X$. Let $alpha in (0, 1]$ and let ${rm Lip}(X,K,d^ alpha)$ denote the Banach algebra of all  continuous complex-valued functions $f$ on$X$ for which$$p_{(K,d^alpha)}(f)=sup{frac{|f(x)-f(y)|}{d^alpha(x,y)} : x,yin K , xneq y}

In this paper, we will present a deenability theorem for rst order logic. This theorem is very easy to state, and its proof only uses elementary tools. To explain the theorem, let us rst observe that if M is a model of a theory T in a language L, then, clearly, any deenable subset S M (i.e., a subset S = fa j M j = '(a)g deened by some formula ') is invariant under all automorphisms of M. The s...