The purpose of this article is to discuss a modified Halpern-type iteration algorithm for a countable family of uniformly totally quasi- ? -asymptotically nonexpansive multi-valued mappings and establish some strong c...The purpose of this article is to discuss a modified Halpern-type iteration algorithm for a countable family of uniformly totally quasi- ? -asymptotically nonexpansive multi-valued mappings and establish some strong convergence theorems under certain conditions. We utilize the theorems to study a modified Halpern-type iterative algorithm for a system of equilibrium problems. The results improve and extend the corresponding results of Chang et al. (Applied Mathematics and Computation, 218, 6489-6497).展开更多
In this paper, the concept of countable compactness degree and the concept of Lindelof property degree are defined in L-fuzzy topological spaces by means of implication operator → Many properties of them are discussed.
A new class of reflected backward stochastic differential equations (RBSDEs) driven by Teugels martingales associated with Lévy process and Countable Brownian Motions are investigated. Via approximation, the exis...A new class of reflected backward stochastic differential equations (RBSDEs) driven by Teugels martingales associated with Lévy process and Countable Brownian Motions are investigated. Via approximation, the existence and uniqueness of solution to this kind of RBSDEs are obtained.展开更多
In the study of Poincaré inequalities, most of the traditional methods were based on the bounded domain in n dimensional Euclidean space Rn, while the method in this paper is based on a countable set E and accord...In the study of Poincaré inequalities, most of the traditional methods were based on the bounded domain in n dimensional Euclidean space Rn, while the method in this paper is based on a countable set E and accordingly the accurate expressions of Poincaré inequalities JB(=(f-μ(f))nJB)=_B≤cD(f, f) is presented to expand the research and application scope. As to inequalities for Ω={DK(x:0DK)≤x_i≤a, i=1,2,…,n}, the existing studies was usually made for n=2, but such an inequality was not the best. Therefore, the different values of n is discussed in this paper, and accordingly the accurate expressions of Poincaré inequalities is presented.展开更多
In this paper,spaces with a locally countable sn-network are discussed.It is shown that a space with a locally countable sn-network iff it is an snf-countable space with a locally countable k-network.As its applicatio...In this paper,spaces with a locally countable sn-network are discussed.It is shown that a space with a locally countable sn-network iff it is an snf-countable space with a locally countable k-network.As its application,almost-open and closed mappings（or finite-to-one and closed mapping） preserve locally countable sn-networks,and a perfect preimage theorem on spaces with a locally countable sn-network is established.展开更多
The concept of local s-countablity is introduced, and the relations between locally s-countable collections and star-countable collections are discussed.
A previous paper showed that the real numbers between 0 and 1 could be represented by an infinite tree structure, called the ‘infinity tree’, which contains only a countably infinite number of nodes and arcs. This p...A previous paper showed that the real numbers between 0 and 1 could be represented by an infinite tree structure, called the ‘infinity tree’, which contains only a countably infinite number of nodes and arcs. This paper discusses how a finite-state Turing machine could, in a countably infinite number of state transitions, write all the infinite paths in the infinity tree to a countably infinite tape. Hence it is argued that the real numbers in the interval [0, 1] are countably infinite in a non-Cantorian theory of infinity based on Turing machines using countably infinite space and time. In this theory, Cantor’s Continuum Hypothesis can also be proved. And in this theory, it follows that the power set of the natural numbers P(ℕ) is countably infinite, which contradicts the claim of Cantor’s Theorem for the natural numbers. However, this paper does not claim there is an error in Cantor’s arguments that [0, 1] is uncountably infinite. Rather, this paper considers the situation as a paradox, resulting from different choices about how to represent and count the continuum of real numbers.展开更多
This paper discusses how the infinite set of real numbers between 0 and 1 could be represented by a countably infinite tree structure which would avoid Cantor’s diagonalization argument that the set of real numbers i...This paper discusses how the infinite set of real numbers between 0 and 1 could be represented by a countably infinite tree structure which would avoid Cantor’s diagonalization argument that the set of real numbers is not countably infinite. Likewise, countably infinite tree structures could represent all real numbers, and all points in any number of dimensions in multi-dimensional spaces. The objective of this paper is not to overturn previous research based on Cantor’s argument, but to suggest that this situation may be treated as a definitional or axiomatic choice. This paper proposes a “non-Cantorian” branch of cardinality theory, representing all these infinities with countably infinite tree structures. This approach would be consistent with the Continuum Hypothesis.展开更多
文摘The purpose of this article is to discuss a modified Halpern-type iteration algorithm for a countable family of uniformly totally quasi- ? -asymptotically nonexpansive multi-valued mappings and establish some strong convergence theorems under certain conditions. We utilize the theorems to study a modified Halpern-type iterative algorithm for a system of equilibrium problems. The results improve and extend the corresponding results of Chang et al. (Applied Mathematics and Computation, 218, 6489-6497).
基金Supported by the National Natural Science Foundation of China(Grant No.11471297)
文摘In this paper, the concept of countable compactness degree and the concept of Lindelof property degree are defined in L-fuzzy topological spaces by means of implication operator → Many properties of them are discussed.
文摘A new class of reflected backward stochastic differential equations (RBSDEs) driven by Teugels martingales associated with Lévy process and Countable Brownian Motions are investigated. Via approximation, the existence and uniqueness of solution to this kind of RBSDEs are obtained.
文摘In the study of Poincaré inequalities, most of the traditional methods were based on the bounded domain in n dimensional Euclidean space Rn, while the method in this paper is based on a countable set E and accordingly the accurate expressions of Poincaré inequalities JB(=(f-μ(f))nJB)=_B≤cD(f, f) is presented to expand the research and application scope. As to inequalities for Ω={DK(x:0DK)≤x_i≤a, i=1,2,…,n}, the existing studies was usually made for n=2, but such an inequality was not the best. Therefore, the different values of n is discussed in this paper, and accordingly the accurate expressions of Poincaré inequalities is presented.
基金Supported by the NNSF of China(1097118510971186)Supported by NSF of Fujian Province(2008F5066)
文摘In this paper,spaces with a locally countable sn-network are discussed.It is shown that a space with a locally countable sn-network iff it is an snf-countable space with a locally countable k-network.As its application,almost-open and closed mappings（or finite-to-one and closed mapping） preserve locally countable sn-networks,and a perfect preimage theorem on spaces with a locally countable sn-network is established.
基金Foundation item:The NSF(10171043,10271026)of China
文摘The concept of local s-countablity is introduced, and the relations between locally s-countable collections and star-countable collections are discussed.
文摘A previous paper showed that the real numbers between 0 and 1 could be represented by an infinite tree structure, called the ‘infinity tree’, which contains only a countably infinite number of nodes and arcs. This paper discusses how a finite-state Turing machine could, in a countably infinite number of state transitions, write all the infinite paths in the infinity tree to a countably infinite tape. Hence it is argued that the real numbers in the interval [0, 1] are countably infinite in a non-Cantorian theory of infinity based on Turing machines using countably infinite space and time. In this theory, Cantor’s Continuum Hypothesis can also be proved. And in this theory, it follows that the power set of the natural numbers P(ℕ) is countably infinite, which contradicts the claim of Cantor’s Theorem for the natural numbers. However, this paper does not claim there is an error in Cantor’s arguments that [0, 1] is uncountably infinite. Rather, this paper considers the situation as a paradox, resulting from different choices about how to represent and count the continuum of real numbers.
文摘This paper discusses how the infinite set of real numbers between 0 and 1 could be represented by a countably infinite tree structure which would avoid Cantor’s diagonalization argument that the set of real numbers is not countably infinite. Likewise, countably infinite tree structures could represent all real numbers, and all points in any number of dimensions in multi-dimensional spaces. The objective of this paper is not to overturn previous research based on Cantor’s argument, but to suggest that this situation may be treated as a definitional or axiomatic choice. This paper proposes a “non-Cantorian” branch of cardinality theory, representing all these infinities with countably infinite tree structures. This approach would be consistent with the Continuum Hypothesis.
