نتایج جستجو برای: definable function
تعداد نتایج: 1215824 فیلتر نتایج به سال:
We study the extensibility of piecewise polynomial functions defined on closed subsets of R2 to all of R2. The compact subsets of R2 on which every piecewise polynomial function is extensible to R2 can be characterized in terms of local quasi-convexity if they are definable in an o-minimal expansion of R. Even the noncompact closed definable subsets can be characterized if semialgebraic functio...
Covering approximation spaces is a class of important generalization of approximation spaces. For a subset X of a covering approximation space (U, C), is X definable or rough? The answer of this question is uncertain, which depends on covering approximation operators endowed on (U, C). Note that there are many various covering approximation operators, which can be endowed on covering approximat...
I-language over simple type structure is considered. Type Y== (0 --t (0 -+ 0)) + (0 -+ 0) is called a binary tree type because of the isomorphism between binary trees and closed terms of this type. Therefore any closed term of type Y+(Y-P ... -P (Y + Y) ) represents an n-ary tree function. The problem is to characterize tree operations represented by the closed terms of the examined type. It is...
Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally subanalytic stochastic games. We prove that the Shapley operator of any definable stochastic game with separable transition and reward functions is definable in...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید