Based on the falling shadow theory, the concept of falling fuzzy (implicative) ideals as a generalization of that of a T ∧-fuzzy (implicative) ideal is proposed in MV-algebras. The relationships between falling fuzzy (implicative) ideals and T-fuzzy (implicative) ideals are discussed, and conditions for a falling fuzzy (implicative) ideal to be a T ∧-fuzzy (implicative) ideal are provided. Some...

An ideal tentacle manipulator is a non-conventional robotic arm with an infinite mobility. It has the capability of taking sophisticated shapes and of achieving any position and orientation in a 3D space. A tentacle manipulator is a hyper redundant or hyper degree of freedom manipulator. Hyper redundant robots produce changes of configuration using a continuous backbone made of sections which b...

There were two kinds of methods in information retrieval, based on content and based on hyper-link. The quantity of computation in systems based on content was very large and the precision in systems based on hyper-link only was not ideal. It was necessary to develop a technique combining the advantages of two systems. In this paper, we drew up a framework by using the two methods. We set up th...

A unifying semantic framework for different reasoning approaches provides an ideal tool to compare these competing alternatives. A historic example is Kripke’s possible world semantics that provided a unifying framework for different systems of modal logic. More recently, Shoham’s work on preferential semantics similarly provided a much needed framework to uniformly represent and compare a vari...

Please see [1] for background on MV-algebras. We address the question, which MV-algebras have finite automorphism group. The automorphism group of the free MV-algebra on 1 generator is just the group of order 2 (folklore). In contrast, it is known that the automorphism group of the free MV-algebra on 2 generators is not even locally finite [4, 2]. Not much else seems to be known. Let us restric...

We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one re-ducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in 7]. The method can be applied in fact to all hyper-polynomial time classes.

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in [7]. The method can be applied in fact to all hyper-polynomial time classes.