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

Ternary and Quaternary Lattice Diagrams are introduced that can find applications to submicron design, and designing new fine-grain digital, analog and mixed FPGAs. They expand the ideas of Lattice diagrams [6, 111 and Linearly Independent (LI) Logic [5, 7, 8, 9, 10, 12, 17, 181. In a regular layout, every cell is connected to 4 , 6 or 8 neighbors and to a number of vertical, horizontal and dia...

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 Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higherorder combinations of generalized truth values have been suggested to account for so-called hypercontradictions. In the present paper, Graham Priest’s treatment of generalized truth values is scrutinize...

Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic...

We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate relations. The semantics are parametrized by the interpretation of aggregate relations in three-valued logic. Any semantics in this family satisfies two important properties: (i) it extends the partial stable semantics for normal logic programs and (ii) total stable models are always minimal. We ...

The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-rst left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice properties of the declarativ...

in this paper we extend the notion of  degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and  introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. it would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. we give the main properties of the operations defined and prove som...