Motivated by the semantics of polymorphic programming languages and typed -calculi, by formal methods in functor category semantics, and by well-known categorical and domaintheoretical constructs, we study domains of natural transformations F : !G of functors F;G: ! C with a small category as source and a cartesian closed category of Scottdomains C as target. We put constraints on the image arr...

The inspiration for this paper is a result proved by Michael Smyth which states that Gordon Plotkin's category SFP is the largest cartesian closed category of domains. Although this category is easily enough motivated from concepts in domain theory and category theory, it is clearly harder to describe and less \elementary" than the most popular categories of domains for denotational semantics. ...

We show that the variational inequality $VI(C,A)$ has aunique solution for a relaxed $(gamma , r)$-cocoercive,$mu$-Lipschitzian mapping $A: Cto H$ with $r>gamma mu^2$, where$C$ is a nonempty closed convex subset of a Hilbert space $H$. Fromthis result, it can be derived that, for example, the recentalgorithms given in the references of this paper, despite theirbecoming more complicated, are not...

‎in this paper, a new class of fuzzy sets called fuzzy strongly ${{g}^{*}}$-closed sets is introduced and its properties are investigated. moreover, we study some more properties of this type of closed spaces.