Draws a Boolean lattice of size 2^N, given input N. I needed a simple script to quickly visualize some big Boolean functions and their properties such as monotonicity and how their True and False ...

The totality of extensional 1-ary connectives distinguishable in a logical framework allowing sequents with multiple or empty (alongside singleton) succedents form a lattice under a natural partial ...

Abstract: Large databases make computation of knowledge discovery more and more expensive, then it is proved counter-evidently that domain knowledge hidden in the database, can often guide and ...

In this paper we study shellable posets (partially ordered sets), that is, finite posets such that the simplicial complex of chains is shellable. It is shown that all admissible lattices (including ...