نتایج جستجو برای: relational existence
تعداد نتایج: 218940 فیلتر نتایج به سال:
in his recognition of being and achievement of truth, man has two instruments in his constitution and two ways before him: intellect and heart; reasoning and intuition. some have opted the way of reasoning and underestimated intuition because of its lack of reasoning, and some have preferred intuition over reasoning because of its being presential (intuitive). with their research on philosophy ...
In 1984, Raoult proposed a formalization of graph rewritings using pushouts in the category of graphs and partial functions. This note generalizes his method and formulates algebraic graph structure to introduce a more general framework for graph rewritings and to give a simple proof of existence theorem of pushouts using relational calculus.
In this paper, two sets of sufficient conditions are obtained to ensure the existence and stability of a unique equilibrium point of unforced first-order fuzzy relational dynamical systems by using two different approaches which are both based on the fuzzy relational matrix of the model.In the first approach, the equilibrium point of the system is one of the centers of the related membership fu...
in this paper, two sets of sufficient conditions are obtained to ensure the existence and stability of a unique equilibrium point of unforced first-order fuzzy relational dynamical systems by using two different approaches which are both based on the fuzzy relational matrix of the model.in the first approach, the equilibrium point of the system is one of the centers of the related membership fu...
The existence of relational products in categories of relations is strongly connected with the representability of that category. In this paper we propose a canonical weakening of the notion of a relational product. Unlike the strong version any (small) category of relations can be embedded into a suitable category providing all weak relational products. Furthermore, we investigate the categori...
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in the study of typed languages, for example to establish contextual equivalences of terms. The chief difficulty in using logical relations is to establish the existence of a suitable relational interpretation. We extend w...
A probabilistic relational database is a compact form of a set of deterministic relational databases (namely, possible worlds), each of which has a probability. In our framework, the existence of tuples is determined by associated Boolean formulae based on elementary events. An estimation, within such a setting, of the probabilities of possible worlds uses a prior probability distribution speci...
We construct an index theorem for smooth infinite economies that shows that generically the number of equilibria is odd. As a corollary, this gives a new proof of existence and gives conditions that guarantee global uniqueness of equilibria.
We present a simple proof of existence of subgame perfect equilibria in games with perfect information.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید