Abstract
In the framework of Ω-sets, where Ω is a complete lattice, we introduce Ω-lattices, both as algebraic and as order structures. An Ω-poset is an Ω-set equipped with an Ω-valued order which is antisymmetric with respect to the corresponding Ω-valued equality. Using a cut technique, we prove that the quotient cut-substructures can be naturally ordered. Introducing notions of pseudo-infimum and pseudo-supremum, we obtain a definition of an Ω-lattice as an ordering structure. An Ω-lattice as an algebra is a bi-groupoid equipped with an Ω-valued equality, fulfilling particular lattice-theoretic formulas. On an Ω-lattice we introduce an Ω-valued order, and we prove that particular quotient substructures are classical lattices. Assuming Axiom of Choice, we prove that the two approaches are equivalent.
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.
