We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It is shown that these equivalences are still valid for the databases that store complex data elements obtained from the recursive nesting of record, list, set and multiset constructors. The major proof argument utilises ...

This paper presents minimization technique for multiple value function using Quine Mc-cluskey‟s method. This paper provide steps for the minimization of multivalued function i.e. radix >2 digital system. The ternary digital system which radix=3 is considered here minimized function of MVL function implemented using decoder and multiplexer and answer is verified using ternary k-map. As the radix...

Programmable logic arrays (PLAs) are being used to implement complex multivalued logic (MVL) circuits. In this paper we introduce three new current-mode CMOS MVL-PLA structures for the implementation of MVL functions. These PLA structures use four current-mode CMOS building blocks namely, cycle, min, tsum and constants. Comparison between the introduced architectures is made based on their resp...

In this paper, we explain a new generalized contractive condition for multivalued mappings and prove a fixed point theorem in metric spaces (not necessary complete) which extends some well-known results in the literature. Finally, as an application, we prove that a multivalued function satisfying a general linear functional inclusion admits a unique selection fulfilling the corresp...

Many questions concerning the semantics of disjunctive databases and of logic pro gramming systems depend on the xed points of various multivalued mappings and operators determined by the database or program We discuss known versions for mul tivalued mappings of the Knaster Tarski theorem and of the Banach contraction map ping theorem and formulate a version of the classical xed point theorem s...

Sibylla Priess-Crampe and Paulo Ribenboim recently established a general xed-point theorem for multivalued mappings deened on generalized ultrametric spaces, and introduced it to the area of logic programming semantics. We discuss, in this context, the applications which have been made so far of this theorem and of its corollaries. In particular, we will relate these results to Scott-Ershov dom...

In this paper, we introduced the notion of a generalized multivalued (α,φ)-almost contractions and establish the existence of fixed point theorems for this class of mapping. The results presented in this paper generalize and extend some recent results in multivalued almost contraction. Also, we show its applications in the Ulam-Hyers stability of fixed point problems for multivalued operators.

In this paper we study multivalued martingales in continuous time. First we show that every multivalued martingale in continuous time can be represented as the closure of a sequence of martingale selections. Then we prove two results concerning the cadlag modifications of continuous time multivalued martingales, in Kuratowski-Mosco convergence and in convergence in the Hausdorff metric respecti...

There are several practical problems of knowledge representation where it is more natural to talk in terms of the set of sentences related to a given topic than to make explicit all the sentences in this set. A problematic feature of classical logic is that if we want to represent this set by a small set which is closed under logical consequence, we can generate sentences related to new topics....

We present the performance of three different multivalued current mode 1-bit adders. These circuits have been simulated with the electrical parameters of a standard 1.2 μm CMOS technology. The performance of a binary voltage mode 1-bit adder is also presented. The binary version uses twice more transistors comparing with multivalued ones, but it is two or three times faster. Multivalued version...