## Math: symbolic logic meets digital circuits: p→q means ¬A or B

The tutor translates p→q to the boolean expression ¬A or B. In my beginning post about symbolic logic, I mention that the statement p implies q, also stated p→q, has the following truth table: p q p→q 0 0 1 …

## Math & Comp Sci: Symbolic Logic: contradiction

The tutor defines, in the context of symbolic logic, contradiction, with a couple of examples. For those new to symbolic logic, my previous post leads back to others that will fill the gaps. A contradiction is a compound statement that …

Tagged with: ,

## Math & Comp Sci: Symbolic Logic: another tautology

The tutor follows up about tautology with another example. For grounding about the symbols, etc, readers may want to refer to my Feb 12 post. In my Feb 13 post I defined tautology with a simple example. Today, I’ll give …

Tagged with: , ,

## Math: logic: what is a tautology?

The tutor continues about logic, defining tautology with an example. In yesterday’s post I began about symbolic logic. A tautology is a compound statement that is always true. For an example, consider the following two statements: p: Today it will …

Tagged with: ,