LearnViz CompSci
Home / Learn / Theory & Discrete Math / Propositional Logic

Beginner Topic 1 of 51 Theory & Discrete Math

Propositional Logic

Reasoning with statements that are true or false.

How it works

Propositional logic studies statements that are either true or false, called propositions, and the connectives that combine them: negation, conjunction (and), disjunction (or), implication and biconditional. The truth of a compound formula follows from the truth values of its parts, which truth tables make explicit. Key ideas are tautologies that are always true, contradictions that are always false, logical equivalence, De Morgan's laws and normal forms such as CNF and DNF.

Step-by-step walkthrough

  1. Propositions are statements that are true or false.
  2. AND is true only if both are true, so P AND Q is false.
  3. OR is true if at least one is true, so P OR Q is true.
  4. NOT flips a value, so NOT P is false.
  5. Truth tables list every combination, and tautologies are always true.

Where it is used

Digital circuit design, program conditions, database queries, formal specifications, SAT solvers and the foundations of mathematical proof use propositional logic.

Common pitfall

Confusing implication with causation is common: p implies q is true whenever p is false. Mixing up the converse, inverse and contrapositive leads to invalid arguments; only the contrapositive is equivalent. Operator precedence differs between notations. Verify equivalences with truth tables or known laws rather than intuition.

Where it fits in the course

Propositional Logic is topic 1 of 51 in Theory & Discrete Math, rated Beginner. It is the first topic in this area. The next topic is Predicate Logic.

Practice and explore

How to study this topic

  1. Read the explanation above and restate the definition in your own words.
  2. Open the interactive lesson and answer its mini quiz.
  3. Read the common pitfall, then write a short example that avoids it.
  4. Check your understanding in the Theory & Discrete Math quiz, and revisit the topic if you miss a question.

Frequently asked questions

What is Propositional Logic?
Reasoning with statements that are true or false. It belongs to Theory & Discrete Math and is a beginner-level topic.
Where do people use Propositional Logic?
Digital circuit design, program conditions, database queries, formal specifications, SAT solvers and the foundations of mathematical proof use propositional logic.
What is the most common mistake with Propositional Logic?
Confusing implication with causation is common: p implies q is true whenever p is false.
What should I learn before this topic?
Nothing earlier in Theory & Discrete Math is required. This is where the area begins.
How can I practice it?
Answer the mini quiz in the interactive lesson, then take the Theory & Discrete Math quiz.
Is Propositional Logic hard to learn?
It is a Beginner topic, so it works as an entry point. If the terms are new, read the explanation twice and try the visualizer before the quiz.
How long does it take to learn Propositional Logic?
Most learners can read the explanation and finish the interactive lesson in under an hour. Fluency comes from applying the idea, so plan a few short practice sessions with the quiz.
Which topics are related to Propositional Logic?
Predicate Logic, Sets and Set Operations, Functions and Relations are closely connected. The full list is in the related topics section of this page.
What should I study after Propositional Logic?
Continue with Predicate Logic, the next topic in Theory & Discrete Math.

Related topics