Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a Boolean value. The automata-theoretic approach for reasoning about Boolean-valued systems has proven to be very useful and powerful. We develop an automata-theoretic framework for reasoning about multi-valued objects, and describ...

Locally convex convolutor spaces are studied which consist of those distributions that define a continuous convolution operator mapping from the space test functions into given locally lattice measures. The endowed with topology uniform convergence on bounded sets. Their structure is characterized via regularization and function-valued seminorms under mild structural assumptions Many recent gen...

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

This paper demonstrates twometa-mathematical propositions concerning the increasingly popular “intuitionistic” (= vague) approaches to fuzzy sets and fuzzy topology, as well as the closely related interval-valued (= grey) sets and interval-valued “intuitionistic” sets: (1) the term “intuitionistic” in these contexts is historically inappropriate given the standard mathematical usage of “intuiti...

and Applied Analysis 3 3. Main Results Throughout this paper, we will consider lattices as complete lattices,X will denote space, and μ is a membership function of any fuzzy set X. Definition 3.1. If m : σ L → R ∪ {∞} satisfies the following properties, then m is called a lattice measure on the lattice σ-algebra σ L . i m ∅ L0. ii For all f, g ∈ σ L such that m f , m g ≥ L0 : f ≤ g ⇒ m f ≤ m g ...