Constructing extended Boolean functions from truth tables using the Mathematica system

Truth Tables are a basic tool in the analysis of compound propositions within the field of propositional logic. However, its usefulness extends beyond, covering aspects of Boolean logic, circuit theory, the Algebra of Sets or systems analysis. The symbolic computational system Mathematica has numerous commands for working with propositions, calculate their truth values and get Boolean functions associated with truth tables, but the result is always presented in the simplest possible form. This simplification, although undoubtedly useful, it is not the most appropriate from the educational point of view. We present a specific modification of the program in order to build gradually the Boolean functions from their truth values, expressing the result in the conjunctive or disjunctive normal forms before making any simplification. This contribution is made with the aim of helping students of Discrete Mathematics at the Computer Engineering degree to understand the process of construction of the Boolean functions, and autonomously check their progress in this discipline.