🔖 Background Information
A truth table is a tool that we can use to determine all of the possible outcomes of a boolean function (Béziau, 2012). In this activity, we will practice writing out some truth tables.
🎯 Problem Statement
Suppose that A, B, and C are boolean variables.
Write out the truth tables for the following expressions:
1. A && B && C
2. (A && B) || (A && C)
3. !A || (B && !C)
4. !A || (A && !B) || (A && !C)
5. !A || !B || !C✅ Acceptance Criteria
Create a truth table for each of the problems outlined in the Problem Statement.
📋 Dev Notes
You might find it useful to create a few extra columns that allow you to break down the solution into smaller steps.
🖥️ Example Output
N/A
📘 Works Cited
Béziau, J.-Y. (2012). A History of Truth-Values. In D. M. Gabbay, F. J. Pelletier, & J. Woods (Eds.), Handbook of the History of Logic (Vol. 11, pp. 235–307). North-Holland. https://doi.org/10.1016/B978-0-444-52937-4.50005-8