Due to the high density and the low consumption power in the digital integrated circuits, mostly technology of CMOS is used. During the past times, the Metal oxide silicon field effect transistors (MOSFET) had been used for the design and implementation of the digital integrated circuits because they are compact and also they have the less consumption power and delay to the other transistors. B...

In this paper we provide a common framework for different stratified $LM$-convergence spaces introduced recently. To this end, we slightly alter the definition of a stratified $LMN$-convergence tower space. We briefly discuss the categorical properties and show that the category of these spaces is a Cartesian closed and extensional topological category. We also study the relationship of our cat...

In this paper we consider the class of truth-functional modal many-valued logics with the complete lattice of truth-values. The conjunction and disjunction logic operators correspond to the meet and join operators of the lattices, while the negation is independently introduced as a hierarchy of antitonic operators which invert bottom and top elements. The non-constructive logic implication will...

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

All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can be derived from it. No such systematic operator-based approach to semantics of disjunctive logic programs has been developed so far. This paper is the first step in this direction. We formalize the concept of one-step-...

We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...

To further increase the speed of computation, this paper aims to design and implement digital circuits entirely within the domain of multi-valued logic. In a fourvalued logic circuit, each wire carries two bits at a time, each logic gate operates two bits at once, and each memory cell records two bits at one time. To make the multi-valued computation possible, this paper describes a simple four...

Abstract We translate the three-valued quantum logic into modal logic, and prove 3-equivalence between valuation of a kind Kripke model in regard to this translation. To 3-equivalence, we introduce an observable-dependent which is fragment many-valued logic. Compared Birkhoff von Neumann’s some notions about observables, completeness relation for example, mechanics can be utilized if employed.