Yaokun Wang
Abstract
In this paper,the weak equivalence concept of a non-empty set was tendered,in terms of it,to discuss some important poverties.We proved that the weak equivalence lattices are the complete sub-lattices of a binany relation lattices.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper,the weak equivalence concept of a non-empty set was tendered,in terms of it,to discuss some important poverties.We proved that the weak equivalence lattices are the complete sub-lattices of a binany relation lattices.
Key concepts: Equivalence (formal languages), Equivalence relation, Mathematics, Pure mathematics, Logical equivalence, Congruence relation, Weak equivalence, Set (abstract data type)