Maximal Elements in Topological Convex Spaces
We introduce axiomatically a more general notion of a convex space dropping one axiom, the so called cancellation law. A wider class of convex sets includes in particular ordinary convex sets and semilattices. Then we introduce a notion of a topological convex space and establish for it theorems like KKM and existence of maximal elements of binary relations.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1998|
|Contact details of provider:|| Postal: France; Universite de Paris I - Pantheon- Sorbonne, 12 Place de Pantheon-75005 Paris, France|
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://cermsem.univ-paris1.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:pariem:98.28. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.