نتایج جستجو برای: r fuzzy hahn banach theorem

تعداد نتایج: 673697  

1999
ISMAT BEG

By using Hahn-Banach theorem, a characterization of random approximations is obtained.

Journal: :Proceedings of the American Mathematical Society 2000

2006
R. E. HARTE

was established by Hahn [1; p. 217] in 1927, and independently by Banach [2; p. 212] in 1929, who also generalized Theorem 0 for real spaces, to the situation in which the functional q :E^>R is an arbitrary subadditive, positive homogeneous functional [2; p. 226]. Theorem 0 was not established for complex spaces until 1938, when it was deduced from the real theorem by Bohnenblust and Sobczyk [3...

Journal: :Journal of the Australian Mathematical Society 1969

2010
DILEEP MENON

In this paper we discuss some fundamental results in real and functional analysis including the Riesz representation theorem, the Hahn-Banach theorem, and the Baire category theorem. We also discuss applications of these theorems to other topics in analysis.

Journal: :Formalized Mathematics 2014

Journal: :international journal of nonlinear analysis and applications 2015
s. abbaszadeh m eshaghi gordji

in this paper, we first introduce the notion of $c$-affine functions for $c> 0$.then we deal with some properties of strongly convex functions in real inner product spaces by using a quadratic support function at each point which is $c$-affine. moreover, a hyers–-ulam stability result for strongly convex functions is shown.

Journal: :Electr. Notes Theor. Comput. Sci. 2008
Guido Gherardi Alberto Marcone

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

2009
ALBERTO MARCONE

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید