Check whether a given relation is boolean algebra
2016-08-23
0 0 0
no vote
Other
Earn points
This program checks whther the given relation on a set is a boolean algebra or not.
In order to verify that first we need to check whether the given set is reflexive, transitive, anti symmetric or not. if it satisfies the above three, then it is called a partially ordered set.
Next we find the minimal, maximal elements. also we find the greatest lower bound[glb] and the least upper bound[lub] if they exist. next we check whether each pair of element in the relation is having glb and lub. if yes then it is called a lattice.
next we check whether the given lattice is distributed and complemented. if yes then it is called a BOOLEAN ALGEBRA.
java
不是
检查
布尔
给定
关系
代数
Related Source Codes
Android AOA Android Open Accessory Development Usi
0
0
no vote
VPN source code accelerator
0
0
no vote
VPN source code
0
0
no vote
Springboot Campus Recruitment System
0
0
no vote
Java intelligent QR code access control management
0
0
no vote
No comment