In this master's thesis the structure of Post's lattice as well as some algorithms on it are presented, together with their implementations in the program Mathematica. These algorithms can be used to find the closure of a given set of logical connectives, to express a given connective in terms of a set of selected connectives whenever possible, or to analyse different algebraic attributes and structure of Post's lattice. The Zhegalkin polynomial form is used to facilitate computations.
|