The state explosion problem is the fundamental limitation of veriication through model checking. In many cases, representing the state space of a system as a lattice is an eeective way of ameliorating this problem. The partial order of the state space lattice represents an information ordering. The paper shows why using a lattice structure is desirable, and why a quaternary temporal logic rathe...

In this paper, a double-layer modificatory linguistic truth-value lattice-valued evaluation method is presented. Its logic basic is based on modificatory linguistic truth-value lattice-valued proposition logic system MLTVLP(X) and operator modificatory linguistic truth-value lattice-valued proposition logic OMLTVLP(X). MLTVLP(X) and OMLTVLP(X) are similar to LTVLP(X) and MLTVLP(X), which have b...

we show that the category of convergence approach spaces is a simultaneously reective and coreective subcategory of the category of latticevalued limit spaces. further we study the preservation of diagonal conditions, which characterize approach spaces. it is shown that the category of preapproach spaces is a simultaneously reective and coreective subcategory of the category of lattice-valued p...

We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...

Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota in the Sixties, we define the Euler characteristic of a formula in Gödel logic (over finitely or infinitely many truth-values). We then prove that the information encoded by the Euler characteristic is classical, i.e. coincides with the analogous notion defined over Boolean logic. Building on th...

The purpose of this paper is to construct a weak hyper semi-quantale as a generalization of the concept of semi-quantale and used it as an appropriate hyperlattice-theoretic basis to formulate new lattice-valued topological theories. Based on such weak hyper semi-quantale, we aim to construct the notion of a weak hypervalued-topology as a generalized form of the so-called lattice-valued t...

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

We show that the category of convergence approach spaces is a simultaneously reective and coreective subcategory of the category of latticevalued limit spaces. Further we study the preservation of diagonal conditions, which characterize approach spaces. It is shown that the category of preapproach spaces is a simultaneously reective and coreective subcategory of the category of lattice-valued p...

the aim of this paper is to introduce and study set- valued homomorphism on lattices and t-rough lattice with respect to a sublattice. this paper deals with t-rough set approach on the lattice theory. the result of this study contributes to, t-rough fuzzy set and approximation theory and proved in several papers. keywords: approximation space; lattice; prime ideal; rough ideal; t-rough set; set...

Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. This paper presents a symbolic model checker for multi-valued temporal logics. The model checker works for any multivalued ...