نتایج جستجو برای: IF-set
تعداد نتایج: 1258182 فیلتر نتایج به سال:
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
the present study is an experimental case study which investigates the impacts, if any, of skopos on syntactic features of the target text. two test groups each consisting of 10 ma students translated a set of sentences selected from advertising texts in the operative and informative mode. the resulting target texts were then statistically analyzed in terms of the number of words, phrases, si...
In standard arithmetic, if we, e.g., accidentally add a wrong number y to the preliminary result x, we can undo this operation by subtracting y from the result x+ y. In this paper, we prove the following two results: • First, a similar possibility to invert (undo) addition holds for fuzzy numbers (although in case of fuzzy numbers, we cannot simply undo addition by subtracting y from the sum). ...
in chapter one we will describe definitions and preliminary results to provide the global context of our own results to be presented in detail in the subsequent chapters in chapter two we consider degree-one maps of the circle and we study their rotation set. our main result in this chapter says that if the map is topologically mixing then its rotation interval is nontrivial (that is, not reduc...
applying two definitions of the union of if-events, p. grzegorzewski gave two generalizations of the inclusion-exclusion principle for if-events.in this paper we prove an inclusion-exclusion principle for if-states based on a method which can also be used to prove grzegorzewski's inclusion-exclusion principle for probabilities on if-events.finally, we give some applications of this principle by...
the space now known as complete erdos space ec was introduced by paul erdos in 1940 as the closed subspace of the hilbert space ?2 consisting of all vectors such that every coordinate is in the convergent sequence {0} ? { 1 n : n ? n}. in a solution to a problem posed by lex g. oversteegen we present simple and useful topological characterizations of ec. as an application we determine the ...
Independence-friendly logic (IF logic) [12, 13] is a conservative extension of first-order logic that can be viewed as a generalization of Henkin's branching quantifiers [8]. For example, in the branching quantifier sentence (2.0.1) ∀ v 0 ∃ v 1 ∀ v 2 ∃ v 3 ϕ(v 0 , v 1 , v 2 , v 3), the rows of the branching quantifier indicate that v 1 depends (only) on v 0 , while v 3 depends (only) on v 2. It...
9:00 am – 10:30 am János C. Fodor, Bernard De Baets, Tomasa Calvo, Structure of uninorms with given continuous underlying t-norms and t-conorms Glad Deschrijver, Etienne E. Kerre, The residuation principle for intuitionistic fuzzy t-norms 11.00 am – 12:30 am Michal Baczynski, On the characterizations of intuitionistic fuzzy implications Carol L. Walker, Elbert A. Walker, T-norms on fuzzy sets o...
The problem of online coloring an unknown graph is known to be hard. Here we consider the problem of online coloring in the relaxed situation where the input must be isomorphic to a given known graph. All that foils a computationally powerful player is that it is not known to which sections of the graph the vertices to be colored belong. We show that the performance ratio of any online coloring...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید