And we will prove the properties of lattices. Together we will learn how to identify extremal elements such as maximal, minimal, upper, and lower bounds, as well as how to find the least upper bound (LUB) and greatest lower bound (GLB) for various posets, and how to determine whether a partial ordering is a lattice. ![]() Boolean Lattice – a complemented distributive lattice, such as the power set with the subset relation.Īdditionally, lattice structures have a striking resemblance to propositional logic laws because a lattice consists of two binary operations, join and meet. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |