Irreducible conjunctive normal forms of the zero function
Discrete mathematics and applications, Research in mathematics, vol. 5, (Editors: Sl. Shtrakov and Iv. Mirchev), Blagoevgrad, 1995, pp. 127-131.
The irreducible conjunctive normal forms (CNF) of the zero constant (as a function of n variables), where each disjunct contains no more than 3 variables (i.e., 3-CNFs) are considered here. Two equivalences - permutation and negation - on variables in 3-CNFs are defined. All 3-CNFs of up to 4 disjuncts in their 3-CNFs are classified according to these equivalences.
Boolean function, SAT, 3-SAT, equivalences, classification