The upward form of duality theorem in ordered vector space is completely solved by Ng-Duhoux theorem and Jameson theorem. However, the situation is quite different in downward form. For example, if V° is order co...The upward form of duality theorem in ordered vector space is completely solved by Ng-Duhoux theorem and Jameson theorem. However, the situation is quite different in downward form. For example, if V° is order convex, it is now only known that V is nearly decomposable in the sense of (?). That is to say,展开更多
文摘The upward form of duality theorem in ordered vector space is completely solved by Ng-Duhoux theorem and Jameson theorem. However, the situation is quite different in downward form. For example, if V° is order convex, it is now only known that V is nearly decomposable in the sense of (?). That is to say,
