Course contentsShow
← Computer Science
Lesson 31 of 2,8722. Discrete Mathematics for CSFree lesson

Propositions and Truth Values

Learn what propositions are, how they differ from other statements, and understand the binary nature of truth values.

Propositions and Truth Values

What you'll learn: You'll understand what makes a statement a proposition and why propositions can only be true or false — never both, never neither.

What Is a Proposition?

A proposition is a declarative statement that is either true or false, but not both. Think of it as a claim about reality that has a definite yes-or-no answer.

Examples of propositions:

  • "5 is greater than 3" (true)
  • "The sky is green" (false)
  • "This computer is on" (true or false, depending on the computer)

Not propositions:

  • "Close the door!" (a command, not a claim)
  • "What time is it?" (a question)
  • "x + 2 = 5" (contains a variable — could be true or false depending on x)

Binary Truth Values

Every proposition has exactly one truth value: either true (T) or false (F). This binary nature is why propositions fit perfectly with digital logic — remember how computers work with 1s and 0s? We can map true to 1 and false to 0.

This connects directly to the Boolean values you learned earlier. Just as a Boolean variable holds true or false, a proposition in logic evaluates to T or F.

Why This Matters

Propositions are the building blocks of logical reasoning in computer science. Every if statement, every condition your program checks, every gate in a circuit — they all evaluate propositions. When your code asks "Is the password correct?" that's checking a proposition's truth value.

Key Takeaway: A proposition is a declarative statement with exactly one truth value (true or false, never both or neither), forming the foundation of logical reasoning in computing.