This paper presents reviews and briefly discuss recent development in spectral methods in switching and multiple-valued logic theory and the design of digital systems.

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

In order to obtain an understanding of parallel logic thought it is necessary to establish a fully abstract model of the denotational semantics of logic programming languages. In this paper, a fixed point semantics for the committed choice, nondeterministic family of parallel programming languages, i.e. the concurrent logic programming languages is developed. The approach is from an order theor...

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.

Closed classes of three-valued logic generated by periodic symmetric funtions that equal 1 in tuples from {1, 2} and equal 0 on the rest tuples are considered. Criteria for bases existence and finite bases existence for these classes is obtained. The problem of the bases existence for some families of closed classes of the three-valued logic functions is considered in the paper. E. Post [1] (se...

Partial functions are abundant in mathematics and program specifications. Unfortunately, their importance has been mostly ignored in automated theorem proving. In this paper, we develop a theorem proving strategy for Partial Classical Logic (PCL). Proof search takes place in Kleene Logic. We show that PCL theories can be translated into equivalent sets of formulas in Kleene logic. For proof sea...

Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when information is gathered from multiple sources). In this paper we propose the use of quasi-boolean multi-valued logics for reasoning about such systems. We also give semantics to a multi-valued extension of CTL, descr...

Residue Number System (RNS) is a modular representation and is proved to be an instrumental tool in many digital signal processing (DSP) applications which require high-speed computations. RNS is an integer and non weighted number system; it can support parallel, carry-free, high-speed and low power arithmetic. A very interesting correspondence exists between the concepts of Multiple Valued Log...