Loading lesson…
Propositional Logic·Concept·Lesson 1 of 6
Introduces propositional logic as the study of how whole statements combine, distinguishes atomic from compound statements, and establishes the discipline of seeing structure before symbolizing.
Overview
Introduces propositional logic as the study of how whole statements combine, distinguishes atomic from compound statements, and establishes the discipline of seeing structure before symbolizing. The practice in this lesson depends on understanding Atomic Statement, Compound Statement, Main Connective, and Truth Functionality and applying tools such as Respect the Main Connective and Assign Sentence Letters Consistently correctly.
In the Learn stage, study the guided explanation and core concepts.
In Examples, look at why each step follows before you write your own.
Apply the idea in Practice, then check your understanding in Review.
What success should let you do: Correctly classify 10 statements as atomic or compound, name the main connective of every compound, and consistently assign sentence letters to atomic parts across 5 short arguments.
This restricted focus is a deliberate choice. By treating each distinct claim as a single unit, propositional logic makes the structure of an argument much easier to see. Complicated English sentences become short symbolic formulas, and those formulas can be manipulated and tested by rules you can learn and apply without guesswork.
Consider a simple example. The sentence 'If tuition increases, then enrollment will decline' contains two separate claims joined by 'if...then.' Propositional logic does not care what tuition is, or what enrollment means. It cares that the overall statement is a conditional, and it tracks whether the conditional relationship holds. That single insight, that logical structure can be separated from subject matter, is the foundation of everything in this unit.
Historically, this separation dates back to the Stoic logicians, who catalogued argument patterns independent of content over two thousand years ago. Modern propositional logic inherits their insight and adds a precise symbolic language for expressing it. The payoff is a set of mechanical tests for validity that work regardless of what the argument is about.
An atomic statement is one you are treating as logically simple at the propositional level. You are not claiming that the sentence is philosophically basic or that it could never be analyzed further. You are making a working choice: for the purposes of this analysis, this claim counts as a single unit and gets a single sentence letter.
The practical rule is strict. Two occurrences of the same claim get the same letter. Two different claims get different letters. If a claim appears once as a negation and once as a positive assertion, it is still the same atomic claim underneath, so it gets the same letter and the negation is expressed by the connective, not by changing the letter.
Here is a concrete illustration. Suppose an argument mentions 'the server is running' in one premise and 'the server is not running' in another. Both sentences involve the same atomic claim: the server is running. You assign one letter, say S, and express the negation as ~S rather than creating a second letter N for 'the server is not running.' If you create a second letter, you lose the logical connection between the two premises and the argument's structure disappears.
Boundary case: sometimes English uses different words to describe what is genuinely the same state of affairs. 'The reactor is overheating' and 'the reactor temperature exceeds the threshold' may or may not be the same claim depending on the context. Your job is to make that judgment call explicitly, record it in the key, and be consistent. There is no algorithmic shortcut for deciding claim identity; it requires careful reading.
A compound statement is built from one or more atomic statements and one or more connectives. The main connective of a compound is the operator with the widest scope: the one that, if you removed it, would leave behind two (or, for negation, one) smaller statements that together make up the whole.
Students often identify the wrong main connective because they fixate on the first or most obvious operator rather than the one governing the entire claim. A good habit is to describe the statement in words before symbolizing it. If you find yourself saying 'this is a conditional whose antecedent is a conjunction,' you have already done the structural work; the symbolization will follow almost mechanically.
Consider the statement: 'If the alarm is triggered and the guard is absent, then the building will be evacuated.' Reading left to right, you encounter 'and' before 'then,' but the main connective is the conditional 'if...then,' because it has the widest scope. The conjunction 'and' only joins the two conditions inside the antecedent. Removing the conditional would split the statement into 'the alarm is triggered and the guard is absent' on one side and 'the building will be evacuated' on the other. Removing the conjunction first would only break apart one piece of the antecedent.
Many real arguments contain statements with two or more levels of nesting. 'If either the sensor fails or the battery dies, and the backup is offline, then the system shuts down' has three connectives: a disjunction, a conjunction, and a conditional. Before you can symbolize it, you must decide what is inside what. Is the conjunction joining the disjunction to the backup clause, with the whole thing serving as the antecedent of the conditional? Or is the conjunction joining the battery clause to a conditional?
English does not always resolve this kind of scope ambiguity on its own. Commas, intonation, and context help in speech, but on paper you often have to make a judgment call. The logician's discipline is to flag the ambiguity, choose the most natural reading, and record the choice. In symbolic notation, parentheses make scope unambiguous, which is one of the main advantages of translating out of English.
A reliable method for handling nested scope is to work from the outside in. First, identify the main connective. Then look at each component it connects and ask whether that component is itself compound. If it is, identify its main connective and repeat. This recursive peeling produces a tree-like structure that maps directly onto parenthesized symbolic notation.
For example, take 'It is not the case that if the bridge is closed then traffic will be diverted.' The main connective is the negation ('it is not the case that'), and its scope is the entire conditional 'if the bridge is closed then traffic will be diverted.' This gives ~(B -> D). If you mistakenly read the negation as applying only to 'the bridge is closed,' you get (~B) -> D, which means something entirely different.
Two arguments about completely different topics can share exactly the same logical form, and propositional logic is built to expose that shared form. When you see 'If it rains the field closes; it is raining; so the field closes' and 'If the server is down the service fails; the server is down; so the service fails,' both arguments have the form P -> Q, P, therefore Q. They stand or fall together as far as propositional validity is concerned.
This is why a disciplined student resists the temptation to evaluate an argument by whether its subject matter is familiar. Surface content is a distraction; structure is the thing that logic can actually test. Training your eye to see structure first is one of the core skills you are building in this unit.
A helpful exercise is to compare two arguments side by side: one with familiar content and one with unfamiliar or even absurd content. For instance, 'If water is H2O, then water contains hydrogen; water is H2O; therefore water contains hydrogen' has the same form as 'If glerbs are zarks, then glerbs contain flim; glerbs are zarks; therefore glerbs contain flim.' Both are valid modus ponens arguments. If you find yourself more confident about the first than the second, that confidence is coming from your knowledge of chemistry, not from logic. Logic gives both arguments the same grade.
Not every short sentence is atomic, and not every long sentence is compound. 'The committee voted unanimously' is atomic at the propositional level even though 'unanimously' packs in a lot of information. On the other hand, 'She passed' can be compound in context if it abbreviates 'She studied and she passed,' with a hidden conjunction the argument relies on.
The test is always functional. Ask: does the argument's logic require me to split this statement into parts connected by a logical connective? If yes, the statement is compound and you need to identify the connective and the parts. If no, the statement is atomic for your purposes, no matter how much internal complexity it might have in some other analysis.
A classic trap is sentences containing the word 'and' as part of a name or predicate rather than as a logical connective. 'Bacon and eggs is a popular breakfast' does not contain a conjunction in the logical sense; the phrase 'bacon and eggs' names a single dish. Similarly, 'the rise and fall of the Roman Empire' uses 'and' to join two nouns inside a predicate, not two separate propositions. If there is no second complete statement on the other side of 'and,' you are not looking at a conjunction.
Everything in this lesson, classifying statements, labeling atomic parts, identifying the main connective, and reading structure independently of topic, feeds directly into symbolization. In the next lesson you will learn the five standard connectives and how each one translates specific English patterns. But the foundational skill is already in place: you can look at a statement and see its logical skeleton before any symbols go on the page.
Before moving on, verify that you can do the following without hesitation. Given any declarative sentence, you should be able to say whether it is atomic or compound. If it is compound, you should be able to name the main connective and describe the statement's structure in ordinary words. And given a short argument with repeated claims, you should be able to assign sentence letters consistently, using the same letter for the same claim and different letters for different claims.
If any of these tasks still feels uncertain, revisit the worked examples below and the practice activities before continuing. The connectives lesson assumes fluency with classification and labeling, and gaps here will compound into larger errors downstream.
Step-by-step visual walkthroughs of key concepts. Click to start.
Pause & recall
Answer each question in one or two sentences from memory. Your answers stay on this page — nothing is sent or graded.
Recall 1
Can I state the main connective in ordinary words before I start symbolizing?
Recall 2
Am I using the same sentence letter every time the same claim reappears?
Recall 3
Have I tracked the scope of every negation?
Core concepts
A declarative sentence that is not further analyzed at the propositional level and is represented by a single sentence letter.
A statement formed from one or more simpler statements by the use of logical connectives.
The connective with the widest scope in a compound statement, which determines the statement's overall logical form.
The property that the truth value of a compound statement is completely determined by the truth values of its component parts.
Reference
Worked Example
Whether the main connective is a negation or a conjunction depends entirely on scope. The same English words can form very different logical structures, and confusing inner versus outer negation changes the truth conditions of the statement.
Content
Scenario
Compare two statements from a sports league memo: (1) 'Nora is not on the roster, and the match will be rescheduled.' (2) 'It is not the case that Nora is on the roster and the match will be rescheduled.' Determine how they differ logically.
False Turns
Worked Example
The atomic/compound distinction is functional, not grammatical. A word like 'and' or 'but' creates a compound only when it joins two complete statements that the argument's logic treats separately.
Content
Scenario
A student encounters these three sentences in an argument about campus dining: (A) 'The cafeteria is open on weekends.' (B) 'The cafeteria is open on weekends but the menu is limited.' (C) 'Peanut butter and jelly is available on Fridays.' Classify each as atomic or compound.
False Turns
Worked Example
Consistent letter assignment is what makes the logical connections between premises visible. Creating extra letters for negated versions of the same claim severs inferential links the argument depends on.
Content
Scenario
An editorial argues: 'If funding is approved, the project will launch. The project will not launch unless the permits are secured. Funding has been approved, but the permits have not been secured.' Assign sentence letters and identify the structure.
False Turns
Worked Example
Propositional logic evaluates structure, not content. Two arguments with identical form receive identical validity verdicts, no matter how different their subject matter. Training yourself to see shared form across topics is one of the most important skills this unit develops.
Content
Scenario
Compare these two arguments from different domains: Argument 1 (biology): 'If the organism is a mammal, then it is warm-blooded. The organism is a mammal. Therefore, it is warm-blooded.' Argument 2 (IT security): 'If the firewall is breached, then the data is exposed. The firewall is breached. Therefore, the data is exposed.' Show that they share the same logical form.
False Turns
Classification Practice
DeductiveClassify each statement as atomic or compound. For compound statements, name the main connective in plain English before symbolizing anything.
Statements to classify
For each statement, say whether it is atomic or compound at the propositional level. If it is compound, name its main connective and list the atomic parts.
Statement A
The library closes at nine tonight.
Ask whether any connective is needed to express this claim.
Statement B
If the power stays on, the exam will run on schedule.
Find the main connective and the atomic parts it joins.
Statement C
Nora is not on the roster, and the match will be rescheduled.
Notice that the negation is inside a conjunction, so the main connective is the conjunction.
Statement D
It is not the case that both the printer is jammed and the toner is empty.
Notice that the negation here applies to the whole conjunction, not just one conjunct.
Statement E
Either the witness is mistaken or the log was tampered with, but not both.
Decide whether this is a plain disjunction, an exclusive disjunction, or something more complex.
~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...PremiseModus Ponens from 1, 2 · MT 3, 4 · DeM 5Enter a propositional formula using variables (P, Q, R...) and connectives. Separate multiple formulas with commas to compare them.
| P | Q | P → Q |
|---|---|---|
| F | F | T |
| F | T | T |
| T | F | F |
| T | T | T |
Build a formal proof step by step. New here? Load a worked example from the menu below to see a complete proof, then try a practice one.
~ or ! = ¬ not& = ∧ and| = ∨ or-> = → if-then<-> = ↔ iffforall / exists → ∀ / ∃Variables: P, Q, R...Shortcuts only fire when focus is inside the proof tool. They use Alt so they don't conflict with text entry in the formula box.
Quantifier symbols: click the ∀, ∃, or = buttons in the Insert palette above, OR type forall / exists / iff / not followed by a space — the tool will replace the word with the proper symbol.
Nothing here yet. The fastest way to learn this tool is to load a worked example from the menu above and read through it.