Introduction
Logical reasoning is the process of using rules of valid inference to determine whether conclusions follow from given information. It helps distinguish what must be true, what may be true, and what available evidence does not justify.
Logic is used in mathematics, philosophy, science, computer programming, law, debate, and everyday decision-making. A logical argument normally contains premises that provide support for a conclusion. In deductive logic, a valid argument is structured so that if its premises are true, its conclusion cannot be false.
Logical reasoning overlaps with analytical reasoning, but its focus is narrower: it concentrates especially on statements, argument structure, inference, consistency, validity, and relationships such as AND, OR, NOT, and IF–THEN.
Learning Objectives
After studying this guide, you should be able to:
Identify statements, premises, and conclusions.
Distinguish deductive and inductive reasoning.
Explain validity, soundness, contradiction, and consistency.
Use logical connectives and basic truth tables.
Apply conditional reasoning and valid inference rules.
Interpret quantifiers such as all, some, and none.
Recognize common logical fallacies and invalid argument forms.
Statements and Truth Values
A logical statement, or proposition, is a sentence that makes a claim that can be classified as either true or false.
Examples:
Earth orbits the Sun.
7 is an even number.
Paris is in France.
The second statement is false, but it is still a logical statement because it has a definite truth value.
Questions and commands are normally not propositions.
Examples:
Where are you going?
Close the door.
Neither is naturally classified as true or false.
Truth Values
The two basic truth values in classical logic are:
T = True
F = False
Logical systems combine simple statements into more complicated statements using connectives.
Arguments
A logical argument contains one or more premises offered as support for a conclusion.
Example:
Premise 1: All planets orbit stars.
Premise 2: Earth is a planet.
Conclusion: Therefore, Earth orbits a star.
Words that often signal premises include:
Because
Since
Given that
As
Words that often signal conclusions include:
Therefore
Thus
Hence
Consequently
Indicator words are useful, but arguments can exist without them.
Deductive Reasoning
Deductive reasoning aims at a conclusion that follows necessarily from its premises.
Example:
Every square has four sides.
Shape X is a square.
Therefore, Shape X has four sides.
If the premises are true and the reasoning is valid, the conclusion must be true.
This is the defining feature of deductive validity.
Inductive Reasoning
Inductive reasoning provides evidence that makes a conclusion probable rather than guaranteed.
Example:
Every swan observed in this lake this week was white.
Therefore, the next swan observed will probably be white.
The conclusion may be reasonable, but it could still be false.
Memory Tip
Deduction → must
Induction → probably
Validity and Soundness
These two terms should not be confused.
Validity
An argument is valid when its structure makes it impossible for all its premises to be true while its conclusion is false.
Validity concerns the relationship between premises and conclusion.
Soundness
An argument is sound when:
It is valid.
Its premises are true.
Therefore:
Sound = valid structure + true premises
An argument can be valid even when one of its premises is false.
Logical Connectives
Compound statements are created by joining or modifying simpler statements.
The most important connectives are:
Connective | Symbol | Meaning |
Negation | ¬P | NOT P |
Conjunction | P ∧ Q | P AND Q |
Disjunction | P ∨ Q | P OR Q |
Conditional | P → Q | IF P, THEN Q |
Biconditional | P ↔ Q | P IF AND ONLY IF Q |
Negation
The negation of a statement reverses its truth value.
If:
P = It is raining
then:
¬P = It is not raining
If P is true, ¬P is false.
If P is false, ¬P is true.
Conjunction: AND
A conjunction has the form:
P ∧ Q
It is true only when both P and Q are true.
Example:
Maya studies mathematics AND physics.
The whole statement is true only if both parts are true.
Disjunction: OR
A disjunction has the form:
P ∨ Q
In standard logic, OR is normally inclusive.
That means the statement is true if:
P is true,
Q is true, or
both are true.
It is false only when both are false.
Important Distinction
Everyday speech sometimes uses an exclusive OR, meaning one option or the other but not both.
Formal logic normally uses inclusive OR unless stated otherwise.
Basic Truth Table
A truth table displays all possible truth-value combinations.
P | Q | P ∧ Q | P ∨ Q |
T | T | T | T |
T | F | F | T |
F | T | F | T |
F | F | F | F |
Truth tables provide a systematic way to examine compound statements and test logical relationships.
Conditional Statements
A conditional has the form:
If P, then Q
Symbolically:
P → Q
Example:
If an integer is divisible by 4, then it is even.
P is the antecedent.
Q is the consequent.
A conditional is false only when P is true and Q is false.
Necessary and Sufficient Conditions
Suppose:
P → Q
Then:
P is sufficient for Q.
Q is necessary for P.
Example:
If a figure is a square, then it is a rectangle.
Being a square is sufficient to establish that the figure is a rectangle.
Being a rectangle is necessary for being a square.
But merely knowing that something is a rectangle does not prove it is a square.
Modus Ponens
Modus ponens is a valid inference form.
Structure:
If P, then Q.
P.
Therefore Q.
Example:
If the alarm is activated, the indicator glows.
The alarm is activated.
Therefore, the indicator glows.
Modus Tollens
Modus tollens is another valid pattern.
Structure:
If P, then Q.
Not Q.
Therefore not P.
Example:
If the device is connected, the connection light appears.
The light does not appear.
Therefore, the device is not connected.
Invalid Conditional Forms
Two common errors look similar to valid conditional arguments.
Affirming the Consequent
Invalid form:
If P, then Q.
Q.
Therefore P.
Example:
If it rains, the pavement becomes wet.
The pavement is wet.
Therefore, it rained.
The pavement could have been washed or sprayed with water.
Denying the Antecedent
Invalid form:
If P, then Q.
Not P.
Therefore not Q.
Example:
If Alex takes the train, Alex reaches the city.
Alex does not take the train.
Therefore, Alex does not reach the city.
Alex might travel by bus.
Converse, Inverse, and Contrapositive
Given:
P → Q
we can construct three related statements.
Form | Statement |
Original | P → Q |
Converse | Q → P |
Inverse | ¬P → ¬Q |
Contrapositive | ¬Q → ¬P |
The contrapositive is logically equivalent to the original conditional.
The converse and inverse are equivalent to each other, but they are not automatically equivalent to the original statement.
Example
Original:
If a number is divisible by 4, it is even.
Contrapositive:
If a number is not even, it is not divisible by 4.
Biconditional
A biconditional has the form:
P ↔ Q
and means:
P if and only if Q
The abbreviation iff is often used for "if and only if."
A biconditional requires both directions:
P → Q
and
Q → P
Example:
An integer is even if and only if it is divisible by 2.
Quantifiers
Quantifiers describe how many members of a category satisfy a condition.
Common quantifiers are:
All
Some
None
OpenStax treats these as basic tools for expressing relationships between sets or categories.
Universal Statements
"All A are B" means:
Every member of A belongs to B.
Example:
All squares are rectangles.
This does not imply:
All rectangles are squares.
Existential Statements
"Some A are B" means:
At least one A is B.
It does not mean:
Most A are B.
Exactly one A is B.
Negative Universal Statements
"No A are B" means:
The sets A and B do not overlap.
Example:
No triangles are circles.
Syllogisms
A syllogism is a structured argument containing premises and a conclusion.
Example:
All mammals are warm-blooded.
Dolphins are mammals.
Therefore, dolphins are warm-blooded.
A valid syllogism depends on the logical relationship among its categories rather than the particular objects named.
Tautology
A tautology is a compound statement that is true under every possible assignment of truth values.
Example:
P ∨ ¬P
Either P is true or P is not true.
Under classical logic, this statement is always true.
Contradiction
A contradiction is false under every possible truth-value assignment.
Example:
P ∧ ¬P
A statement and its negation cannot both be true in classical logic.
Contingency
A contingent statement is true under some conditions and false under others.
Example:
P ∧ Q
Its truth depends on the truth values assigned to P and Q.
Memory Tip
Tautology → always true
Contradiction → always false
Contingency → depends
Logical Equivalence
Two statements are logically equivalent when they have identical truth values under every possible circumstance.
One important equivalence is:
P → Q
is equivalent to:
¬Q → ¬P
That is why a conditional and its contrapositive express the same logical relationship.
De Morgan's Laws
De Morgan's laws describe how negation interacts with AND and OR.
They are:
¬(P ∧ Q) ≡ ¬P ∨ ¬Q
and
¬(P ∨ Q) ≡ ¬P ∧ ¬Q
Example:
Negating:
Ana studies mathematics AND history.
gives:
Ana does not study mathematics OR Ana does not study history.
It does not require that she studies neither subject.
Consistency
A set of statements is consistent when they can all be true at the same time.
Example:
Sam is older than Jo.
Jo is older than Mia.
These statements are consistent.
Add:
Mia is older than Sam.
Now the three claims cannot all be true under the ordinary meaning of "older than."
Detecting inconsistency is an important logical-reasoning skill.
Logical Fallacies
A fallacy is an error in reasoning.
Ad Hominem
Attacking the person instead of addressing the argument.
Example:
Her argument about taxes must be wrong because she is unpleasant.
Straw Man
Misrepresenting an argument so it is easier to attack.
False Dilemma
Presenting only two possibilities when additional options exist.
Example:
Either we cancel the project or we waste all our money.
There may be other alternatives.
Hasty Generalization
Drawing a broad conclusion from inadequate evidence.
Circular Reasoning
Using the conclusion itself as support for the conclusion.
Example:
This source is reliable because it gives trustworthy information.
Appeal to Popularity
Claiming that something must be true because many people believe it.
Red Herring
Introducing irrelevant information that distracts from the actual issue.
Formal vs Informal Logic
Formal logic studies argument structure using symbolic systems.
Examples include:
Propositional logic
Predicate logic
Mathematical logic
Informal logic examines arguments expressed in ordinary language.
It often focuses on:
Assumptions
Relevance
Evidence
Fallacies
Argument quality
Both forms are useful.
Common Mistakes
Truth and Validity Are Different
A statement can be true or false.
An argument can be valid or invalid.
Do not call a single statement "valid" when you mean "true."
A Valid Argument Can Have False Premises
Validity concerns structure.
Soundness requires validity plus true premises.
"Some" Does Not Mean "All"
From:
Some birds cannot fly.
you cannot conclude:
All birds cannot fly.
Do Not Reverse Conditionals
From:
P → Q
you cannot automatically infer:
Q → P
OR Usually Allows Both
In formal logic:
P OR Q
normally includes the possibility that both are true.
Possibility Is Not Necessity
Showing that something could be true does not prove that it must be true.
Problem-Solving Strategy
Use this sequence when solving logic questions:
1. Identify the Statements
Separate factual statements from questions, commands, or irrelevant information.
2. Find the Premises and Conclusion
Determine what is being claimed and what evidence supports it.
3. Translate the Structure
Use symbols where useful:
¬ = NOT
∧ = AND
∨ = OR
→ = IF–THEN
↔ = IF AND ONLY IF
4. Apply Valid Inference Rules
Look for forms such as:
Modus ponens
Modus tollens
Syllogisms
Contraposition
5. Search for Counterexamples
A single valid counterexample can show that a universal claim or proposed inference is not logically necessary.
Memory Tips
For arguments:
Premise → support
Conclusion → result
For argument quality:
Valid → correct logical structure
Sound → valid + true premises
For connectives:
¬ → NOT
∧ → AND
∨ → OR
→ → IF–THEN
↔ → IF AND ONLY IF
For conditional reasoning:
P, P → Q → Q
¬Q, P → Q → ¬P
For statement types:
Tautology → always true
Contradiction → always false
Contingency → sometimes true
Summary
Logical reasoning studies whether conclusions follow from information according to valid rules of inference. Logical statements have truth values, while arguments contain premises and conclusions. Deductive reasoning aims at necessary conclusions, whereas inductive reasoning provides probabilistic support.
Formal logic uses connectives such as NOT, AND, OR, IF–THEN, and IF AND ONLY IF. Truth tables show how compound statements behave under every possible assignment of truth values. Conditional reasoning is especially important. Modus ponens and modus tollens are valid, while affirming the consequent and denying the antecedent are not. The contrapositive of a conditional is logically equivalent to the original statement.
Quantifiers such as all, some, and none describe relationships between categories. Tautologies are always true, contradictions are always false, and contingent statements depend on circumstances.
For quizzes, focus on structure rather than intuition. Ask what the premises actually establish and whether another logically possible situation could make the proposed conclusion false.
FAQ
What is logical reasoning?
Logical reasoning is the use of structured rules and relationships to determine whether conclusions follow from given information.
What is a logical statement?
It is a claim capable of being classified as true or false.
What is the difference between a premise and conclusion?
A premise provides support. A conclusion is the claim the argument attempts to establish.
What makes an argument valid?
An argument is valid when there is no logically possible situation in which all its premises are true and its conclusion is false.
What makes an argument sound?
It must be valid and have true premises.
What does P → Q mean?
It means if P, then Q.
What is a contrapositive?
The contrapositive of P → Q is ¬Q → ¬P. It is logically equivalent to the original conditional.
What is a tautology?
A tautology is a statement that is true under every possible assignment of truth values.
What does "some" mean in logic?
It means at least one.
What is a logical fallacy?
A logical fallacy is a flaw or error in reasoning.
Key Takeaways
Logical reasoning evaluates relationships between statements, premises, conclusions, and inferences.
Deductive validity means true premises would guarantee the conclusion, while soundness additionally requires the premises to be true.
NOT, AND, OR, IF–THEN, and IF AND ONLY IF are fundamental logical connectives.
Modus ponens and modus tollens are valid conditional arguments; reversing a conditional can produce invalid reasoning.
Quantifiers, truth tables, counterexamples, and symbolic notation are powerful tools for solving logic problems.
References
Stanford Encyclopedia of Philosophy — Inductive Logic
Scholarly discussion of arguments, deductive entailment, inductive support, evidence, and the relationship between premises and conclusions.
Stanford Encyclopedia of Philosophy — Inductive LogicInternet Encyclopedia of Philosophy — Deductive and Inductive Arguments
Academic overview of deductive validity, inductive strength, premises, conclusions, and major distinctions between forms of reasoning.
Internet Encyclopedia of Philosophy — Deductive and Inductive ArgumentsInternet Encyclopedia of Philosophy — Argument
Detailed reference on argument structure, premises, conclusions, validity, inference, and classifications of arguments.
Internet Encyclopedia of Philosophy — ArgumentOpenStax — Statements and Quantifiers
Educational guide to propositions, truth values, premises, conclusions, and quantifiers such as all, some, and none.
OpenStax — Statements and QuantifiersOpenStax — Constructing Truth Tables
Guide to truth values, negation, conjunction, disjunction, and truth-table analysis.
OpenStax — Constructing Truth TablesOpenStax — Logic Key Concepts
Summary of logical connectives, conditional statements, equivalence, De Morgan's laws, arguments, and inference rules.
OpenStax — Logic Key ConceptsOpenStax — Logical Arguments
Educational resource covering validity, soundness, deductive arguments, conditional inference, and common fallacies.
OpenStax — Logical Arguments