The Four Functionals Fixed Point Theorem is a generalization of the original, as well as the functional generalizations, of the Leggett–Williams Fixed Point Theorem. In the Four Functionals Fixed Point Theorem, neither the upper nor the lower boundary of the underlying set is required to map below or above the boundary in the functional sense. As an application, the existence of a positive solu...

We propose a new approach to the design of relational database schemes. The main features of the approach are: (4 A combination of the traditional decomposition and synthesis approaches, thus allowing the use of both functional and multivalued dependencies. (b) Separation of structural dependencies relevant for the design process from integrity constraints, i.e., constraints that do not bear an...

in this paper, we present some common fixed point theorems for two generalized nonexpansive multivalued mappings in cat(0) spaces as well as in uced banach spaces. moreover, we prove the existence of fixed points for generalized nonexpansive multivalued mappings in complete geodesic metric spaces with convex metric for which the asymptotic center of a bounded sequence in a bounded closed convex...

The purpose of this paper is to prove end-point theorems for multivalued mappings satisfying comparatively a more general contractive condition in ordered complete metric spaces. Afterwards, we extend the results of previous sections and prove common end-point results for a pair of T-weakly isotone increasing multivalued mappings in the underlying spaces. Finally, we present common end point fo...

The basic aim of our study is to give a possible model for handling uncertain information. This model is worked out in the framework of DATALOG. The concept of multivalued knowledgebase will be defined as a quadruple of any background knowledge; a deduction mechanism; a connecting algorithm, and a function set of the program, which help us to determine the uncertainty levels of the results. At ...

The theory of iterated function systems (IFSs) has been an active area research on fractals and various types self-similarity in nature. basic theoretical work IFSs proposed by Hutchinson. In this paper, we introduce a new generalization Hutchinson IFS, namely generalized ?-contraction which is finite collection functions T1,…,TN from Cartesian product space X×?×X into X, where (X,d) complete m...

Kaneko and Sessa defined the concept of compatibility for multivalued mappings with Hausdorff metric and proved a coincidence point theorem. After then, Pathak defined the concept of weak compatibility and proved a coincidence theorem. In the present work, we define a new type compatibility for multivalued mappings with Hausdorff metric. This new type compatibility is different from compatibili...

Multivalued projections are applied to the study of weighted least squares solutions linear relations equations (or inclusions) and some its applications. To this end a matrix representation multivalued with respect closure their ranges is described.

The study of fixed points of single-valued self-mappings or multivalued self-mappings satisfying certain contraction conditions has a great majority of results inmetric fixed point theory. All these results are mainly generalizations of Banach contraction principle. The Banach contraction principle guarantees the existence and uniqueness of fixed points of certain self-maps in complete metric s...

Nesting of relations is very much essential for many database representations in reality. Nesting of relations tends to reduce the data redundancy in the relations. It helps in dropping certain constraints in normalization which tend to omit certain sensitive data when tried to be normalized. Query processing or conversion of data repositories, as required, can be easily being tackled by the ai...