# Introduction to boolean logic

 Type classification: this is a lesson resource.

Welcome! This is a lesson in the Introductory Discrete Mathematics for Computer Science course here at Wikiversity.

## Basic Principles of Logic

For computer science, it is necessary to understand the basics of logic. Logic is the foundation on which a computer system is built internally. Bits are switched on and off using the binary 1's and 0's. In Boolean Logic, these translate into T (true) and F (false) statements.

## Propositions

• Definition: A statement that is either true or false.
 Which statement is a proposition?
 Which bird did the cat kill? WRONG! Try again. William's wife's name is Irene. Correct! Wherefore art thou, Romeo? WRONG! Try again. Give me an A! WRONG! Try again.

 Which statement is not a proposition?
 Roland's daughter is Rolanda. WRONG! Try again. His tomb says "Trail Blazer." WRONG! Try again. Roland won many awards. WRONG! Try again. Tell me what Roland does. Correct!

 Which statement is a proposition?
 2 + 3 = 5 Read the question again! 4 / 9 WRONG! Try again. 1 + 1 = 3 Read the question again! Both A and C Correct!

## Next Lesson

The second lesson of the course is Using truth tables.