Abstract
A convex structure is binary if every finite family of pairwise intersecting convex sets has a non-empty intersection. Distributive lattices with the convexity of all order-convex sublattices are a prominent type of examples, because they correspond exactly to the intervals of a binary convex structure which has a certain separation properly. In one direction, this result relies on a study of so-called base-point orders induced by a convex structure. Thesis ordering are used to construct an ‘intrinsic’ topology. For binary convexities, certain basic questions are answered with the aid of some results on completely distributive lattices. Several applications are given. Dimension problems are studied in a subsequent paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
