Abstract
Bilattices as algebras with two lattice structures were introduced by M. Ginsberg and M. Fitting in 1986–1990. They have found wide applications in logic programming, multivalued logic, and artificial intelligence. We call these bilattices Ginsberg’s bilattices. The description of Ginsberg’s bilattices was obtained by various authors under the conditions of interlacement (or distributivity) and boundedness. In this paper, we prove that this description remains true without the second condition, while interlacement can be replaced with a weaker form called weak interlacement here. In particular, we prove that every weakly interlaced bilattice is isomorphic to the superproduct of two lattices, while every weakly interlaced Ginsberg bilattice is isomorphic to the Ginsberg superproduct of two equal lattices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Proceedings of the Steklov Institute of Mathematics
Disclaimer: 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.