Abstract

In contrast to Hintikka’s enormously complex distributive normal forms of first- order logic, this paper shows how to generate minimized disjunctive normal forms of first-order logic. An effective algorithm for this purpose is outlined, and the benefits of using minimized disjunctive normal forms to explain the truth conditions of propo- sitions expressible within pure first-order logic are presented.