In this paper, we present a new class of cyclic (noncyclic) α-ψ and β-ψ condensing operators survey the existence best proximity points (pairs) as well coupled in setting reflexive Busemann convex spaces. Then an application main result to study optimal solution for system differential equations is demonstrated.

The purpose of the present work is to establish a one-to-one correspondence between the family of interval type-2 fuzzy reflexive/tolerance approximation spaces and the family of interval type-2 fuzzy closure spaces.

‎in this article we discuss examples of fractal $omega$-operads‎. ‎thus we show that there is an $omega$-operadic approach to explain existence of‎ ‎the globular set of globular setsfootnote{globular sets are also called $omega$-graphs by the french school.}‎, ‎the reflexive globular set of reflexive globular sets‎, ‎the $omega$-magma of $omega$-magmas‎, ‎and also the reflexive $omega$-magma of...

it is well known fact that binary relations are generalized mathematical functions. contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. some basic operations on functions such as the inverse and composition are applicable to binary relations as well. depending on the domain or range or both are fuzzy value fuzzy set, i...

We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive forests. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating condition is related firstly to connectivity, and thereafter to accessibility from all vertices of H to connected reflexive subgraphs. In the case of partially reflexive paths...

The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...

1. Introduction This study provides a computer-simulated optimal selection of antecedent of reflexive pronouns based on the Visual C++ computer programming language. The algorithm that I use for this implementation is based on the optimal theoretic approach to the proper interpretation of reflexive pronoun roughly adopted in Moon (1999). I show that the complex behavior of reflexive pronouns ca...

Let R be a commutative noetherian local ring that is not Gorenstein. It is known that the category of totally reflexive modules over R is representation infinite, provided that it contains a non-free module. The main goal of this paper is to understand how complex the category of totally reflexive modules can be in this situation. Local rings (R, m) with m3 = 0 are commonly regarded as the stru...

Although much is known about volitional and reflexive smooth eye movements individually, much less is known about how they are coordinated. It is hypothesized that separate cortico-ponto-cerebellar loops subserve these different types of smooth eye movements. Specifically, the MT-MST-DLPN pathway is thought to be critical for ocular following eye movements, whereas the FEF-NRTP pathway is under...