Multi-valued logics introducing propositional multi-valued logics with the help of a CAS

It is shown in this paper how a classical approach to multi-valued Logics, based on the use of truth tables, can be easily implemented in a Computer Algebra System (CAS). Producing truth-tables by hand is a hard work. But we think that an important part of the experience and intuitive ideas come from working with them. This programme deals with Kleene's style (min/max) p-valued Logic (for any given prime number p), and it can Build the truth tables corresponding to a list of given propositions. Check if a given proposition is a tautology. Check if the second of two given propositions is a tautological consequence of the first one. For instance for which values of p "is a tautological consequence" and "implies is a tautology" are equivalent can easily be tested. Examples of some of the exercises that can be solved with the programme and some notes about our experience in the classroom with this kind of software are also included.