sciandu
Mathematics

Mathematics

Logical statements

True or false, and or not: logical statements show how simple claims combine into sure conclusions.

Is it cold outside and is it raining? Only when both hold do you take a scarf and umbrella. Without noticing, you constantly combine statements into new statements. Propositional logic makes these combinations precise and checkable.

Statements are true or false

A statement is a sentence that is either true or false, but never both. The sentence 3>23 > 2 is true, the claim that 3 is an even number is false. Questions and requests, in contrast, are not statements: neither asking for the time nor asking someone to close the window can be labelled true or false. We name statements briefly with letters like AA and BB.

And, or, not

From statements you build new ones with three basic blocks. The and, written ABA \land B, is only true when both parts are true. The or, written ABA \lor B, is true as soon as at least one part is true. It deliberately includes the case where both are true, unlike the everyday either or. The not, written ¬A\lnot A, simply flips true and false.

Logic gate
A
B
Output
ABAND
000
010
100
111

1 AND 0 = 0

Try it: switch the inputs to true or false and watch how and, or and not decide the result.

The truth table

To fully understand a connective, you list all combinations of true and false. For one statement there are two rows, for two statements four, for three statements eight. With each further statement the number of rows doubles. The table then shows for each combination whether the compound statement is true or false. It also lets you check whether two differently written expressions have the same value in every row. If they do, they mean the same thing, and you may put an equals sign between them.

¬(AB)=¬A¬B\lnot(A \land B) = \lnot A \lor \lnot B
One of De Morgan's rules: the not moves inward and turns the and into an or. In words: not both at once means at least one is not.

The if-then statement

Very common is the form if AA, then BB. It claims only one thing: if the first part is true, the second must be true as well. Such a statement is false only when AA is true but BB is false. If AA is false from the start, the statement counts as true, no matter what happens with BB. An example: if it rains, the street is wet. You can refute this sentence only on a rainy day with a dry street, whereas on a sunny day it promises nothing at all.

Exercises

0 of 6 solved

Time to try it yourself. You can't break anything, every attempt counts.

Statement AA is true, statement BB is false. What is ABA \land B (A and B)?

Statement AA is true, statement BB is false. What is ABA \lor B (A or B)?

How many of the two parts must be true for ABA \land B to be true?

Match each connective to its meaning.

ABA \land B
ABA \lor B
¬A\lnot A

How many rows does the truth table of a single statement AA have?

By De Morgan's rule, ¬(AB)=¬A\lnot(A \land B) = \lnot A ¬B\lnot B.