Correspondence (truth) tables are the main model for the analysis of various logical expressions. Their applications go beyond the study of Boolean algebra. The Maple computer algebra system has a wide range of commands for working with propositions, obtaining and evaluating their truth, but the result of their execution is most often not represented in a perfectly normal form. The results obtained are undoubtedly useful, but do not contribute to the development of competencies in the field of modeling Boolean functions. In this case, using the programming methods of the Maple computer algebra system, as well as its ability to create interactive applications. The article presents the results of a study summarizing the experience of implementing computer algebra systems for modeling logical functions. To expand the possibilities, comply with the requirements of interactivity, the Maple computer algebra system was chosen as the main tool. The developed and presented interactive application allows you to automatically build Boolean functions based on their truth or falsity values and present the result in the form of perfect disjunctive or conjunctive normal forms. The authors presented the features of using the developed application. The main goal: to achieve an understanding of the process of building a model of Boolean functions, presented in a perfect disjunctive or conjunctive form, to help in the study of discrete mathematics, students of both technical and humanitarian specialties. In addition, evaluate your knowledge in this discipline.