A compound proposition is a statement made by combining simple propositions with connectives like and, or, and not. In Formal Logic I, you analyze its truth value with truth tables and use it to test validity.
A compound proposition is a statement in Formal Logic I made by combining two or more simple propositions with logical connectives such as conjunction, disjunction, and negation. Instead of standing alone like a simple proposition, it gets its meaning from how the parts are linked.
Think of it as a sentence with structure. If p means "It is raining" and q means "The sidewalk is wet," then "It is raining and the sidewalk is wet" is a compound proposition. The whole statement can be true or false, and its truth depends on the truth of p, q, and the connective between them.
This is why compound propositions are also called molecular propositions in many logic classes. The parts are the atomic propositions, and the larger sentence is built out of them. Once you can spot that structure, you can translate ordinary language into symbols and stop guessing at what a sentence "really means."
The connective matters just as much as the parts. "And" requires both parts to be true, so it behaves differently from "or," which is usually inclusive in formal logic. "Not" flips the truth value of a proposition, so it can turn a true statement false or a false statement true. That means two compound propositions can use the same simple propositions and still have very different truth conditions.
In Formal Logic I, compound propositions are the stuff you actually build truth tables for. You list every possible combination of truth values for the simple propositions, then check how the whole statement comes out in each case. That process lets you see whether a formula is always true, always false, or sometimes true and sometimes false. Once you have that skill, you can handle longer symbolic arguments without treating them like word puzzles.
A small example shows the idea clearly. If p is true and q is false, then p ∧ q is false, but p ∨ q is true. Same pieces, different compound statement, different result. That difference is the whole point of studying compound propositions: logic is not just about what words are in a sentence, but about how the sentence is put together.
Compound propositions are the bridge between ordinary language and symbolic logic in Formal Logic I. Once you can identify the structure of a compound statement, you can translate arguments into symbols, test them with truth tables, and see whether the reasoning really works.
This term also shows up every time you classify a proposition as atomic or molecular. If a sentence can be broken into parts joined by a connective, it is no longer a simple building block. That classification matters because atomic statements are handled differently from statements whose truth depends on multiple pieces.
Compound propositions are the starting point for the big truth-table concepts that usually come later in the course, especially tautologies, contradictions, and contingencies. Those labels only make sense after you know how the full statement behaves across every possible assignment of truth values.
They also help you avoid a common mistake in logic classes: reading English words too loosely. Everyday language can hide connectives or make them ambiguous, but symbolic logic forces you to show the exact structure. That is what lets you tell whether an argument is valid, whether a statement can ever be false, and whether two sentences are logically equivalent.
Keep studying Formal Logic I Unit 3
Visual cheatsheet
view gallerySimple Proposition
A simple proposition is the basic unit that a compound proposition is built from. If the statement cannot be broken into smaller statements joined by connectives, it is simple rather than compound. When you translate English into symbols, identifying the simple parts first makes the rest of the analysis much easier.
Logical Connective
Logical connectives are the words or symbols that turn separate propositions into one compound proposition. The connective controls the truth conditions, so the same two simple propositions can produce different results depending on whether you use and, or, or not. In truth tables, the connective is what you are actually testing.
Truth Table
Truth tables are the main tool for analyzing compound propositions in Formal Logic I. You list the possible truth values for the simple propositions, then check the compound statement row by row. This lets you see patterns that are hard to spot in ordinary language, especially when a sentence gets longer or has more than one connective.
Law of Excluded Middle
The Law of Excluded Middle says that a proposition must be either true or false, with no third option. Compound propositions still follow that rule, even when they include negation or other connectives. That idea is one reason truth tables work so cleanly, since each row assigns truth values in a strict yes-or-no way.
A quiz or problem-set question will usually give you an English statement or a symbolic formula and ask you to identify whether it is compound, then build or complete its truth table. You might need to point out the simple propositions inside it, name the connective, and decide whether the whole statement is a tautology, contradiction, or contingency. If the wording is tricky, the real move is translating the sentence carefully before you evaluate it. A missed connective or a misplaced "not" changes the entire answer. In discussion questions or short proofs, you may also use compound propositions to explain why an argument form works or fails by showing how the truth values behave.
These are easy to mix up because both are propositions, but they are not built the same way. A simple proposition stands on its own and does not contain smaller propositions joined by connectives. A compound proposition has parts, and those parts are what give it its truth conditions.
A compound proposition is a single statement made from two or more simpler propositions joined by a logical connective.
Its truth value depends on both the truth values of the parts and the exact connective connecting them.
In Formal Logic I, compound propositions are what you translate into symbols and test with truth tables.
The same simple propositions can produce different compound statements, like p ∧ q and p ∨ q, with different truth conditions.
Spotting compound structure helps you separate atomic propositions from molecular ones and classify formulas as tautologies, contradictions, or contingencies.
It is a statement made by combining simple propositions with logical connectives like and, or, and not. The whole statement has one truth value, but that value depends on the parts and the way they are linked. In this course, you use compound propositions to build truth tables and analyze arguments.
If the statement can be broken into smaller propositions connected by a logical word or symbol, it is compound. If it stands alone and cannot be split into smaller truth-evaluable parts, it is simple. A sentence like "p and q" is compound, while "p" by itself is simple.
If p means "The library is open" and q means "The printer works," then "The library is open and the printer works" is a compound proposition. You can test it with a truth table by checking every possible truth value combination for p and q. The connective tells you exactly how to evaluate the whole statement.
Truth tables are built to show how compound propositions behave across every possible combination of truth values. That makes them the main tool for checking whether a formula is always true, always false, or sometimes true and sometimes false. Without compound propositions, there would be nothing interesting to table beyond single statements.