On near-standardness in Hilbert spaces.
Lyantse, W.E., Kudrik, T.S. (2002)
Sibirskij Matematicheskij Zhurnal
Similarity:
Displaying similar documents to “Term Context”
On near-standardness in Hilbert spaces.
Differential Equations on Functions from R into Real Banach Space
Keiko Narita, Noboru Endou, Yasunari Shidama (2013)
Formalized Mathematics
Similarity:
In this article, we describe the differential equations on functions from R into real Banach space. The descriptions are based on the article [20]. As preliminary to the proof of these theorems, we proved some properties of differentiable functions on real normed space. For the proof we referred to descriptions and theorems in the article [21] and the article [32]. And applying the theorems of Riemann integral introduced in the article [22], we proved the ordinary differential equations...
Semantics of MML Query
Grzegorz Bancerek (2012)
Formalized Mathematics
Similarity:
In the paper the semantics of MML Query queries is given. The formalization is done according to [4]
Covering of the null ideal may have countable cofinality
Saharon Shelah (2000)
Fundamenta Mathematicae
Similarity:
We prove that it is consistent that the covering number of the ideal of measure zero sets has countable cofinality.
Weak variants of Martin's Axiom
J. Barnett (1992)
Fundamenta Mathematicae
Similarity:
Examples exist of smooth maps on the boundary of a smooth manifold M which allow continuous extensions over M without fixed points but no such smooth extensions. Such maps are studied here in more detail. They have a minimal fixed point set when all transversally fixed maps in their homotopy class are considered. Therefore we introduce a Nielsen fixed point theory for transversally fixed maps on smooth manifolds without or with boundary, and use it to calculate the minimum number of...
On classifying subsets of natural numbers by their computable permutations.
Combarro, E.F. (2004)
Sibirskij Matematicheskij Zhurnal
Similarity:
Mizar Analysis of Algorithms: Algorithms over Integers
Grzegorz Bancerek (2008)
Formalized Mathematics
Similarity:
This paper is a continuation of [5] and concerns if-while algebras over integers. In these algebras the only elementary instructions are assignment instructions. The instruction assigns to a (program) variable a value which is calculated for the current state according to some arithmetic expression. The expression may include variables, constants, and a limited number of arithmetic operations. States are functions from a given set of locations into integers. A variable is a function...
Partial Differentiation of Vector-Valued Functions on n -Dimensional Real Normed Linear Spaces
Takao Inoué, Adam Naumowicz, Noboru Endou, Yasunari Shidama (2011)
Formalized Mathematics
Similarity:
In this article, we define and develop partial differentiation of vector-valued functions on n-dimensional real normed linear spaces (refer to [19] and [20]).
Bertrand’s Ballot Theorem
Karol Pąk (2014)
Formalized Mathematics
Similarity:
In this article we formalize the Bertrand’s Ballot Theorem based on [17]. Suppose that in an election we have two candidates: A that receives n votes and B that receives k votes, and additionally n ≥ k. Then this theorem states that the probability of the situation where A maintains more votes than B throughout the counting of the ballots is equal to (n − k)/(n + k). This theorem is item #30 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/. ...
Combinatorial trees in Priestley spaces
Richard N. Ball, Aleš Pultr, Jiří Sichler (2005)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We show that prohibiting a combinatorial tree in the Priestley duals determines an axiomatizable class of distributive lattices. On the other hand, prohibiting -crowns with does not. Given what is known about the diamond, this is another strong indication that this fact characterizes combinatorial trees. We also discuss varieties of 2-Heyting algebras in this context.