πŸ“Œ Sentences and Truth-Values βš–οΈ
βš–οΈ

The Concept of a Statement

Definition

In logic, we make a strict distinction between Statements and Non-Statements. Logic is the study of valid reasoning between statements; therefore, non-statements cannot serve as the building blocks of an argument.

βœ… Statements

A statement is a sentence that is either True (T) or False (F). If a sentence can be assigned a truth value, it is logically usable.

❌ Non-Statements

These are sentences that lack a truth value. They cannot be true or false.

  • ❓ Questions: (e.g., "Where is Nizwa city?")
  • βœ‹ Requests/Commands: (e.g., "Please shut the door")
  • ❗ Exclamations: (e.g., "Wow!")
  • 🀝 Proposals/Suggestions: (e.g., "Let's go to a movie")
⚠️ Exam Trap Students often mistake a question or a command for a statement. Remember: If you cannot ask "Is that true?" about the sentence, it is not a statement.
πŸ“Œ The Structure of Arguments πŸ—οΈ
πŸ—οΈ

Argument Components

Structure

An argument is not just a collection of sentences; it is a specific relationship where certain sentences (premises) are intended to provide support for a claim (conclusion).

🧱 Premises

The sentences that act as the evidence, reasons, or support for the claim.

🏁 Conclusion

The sentence that is claimed to follow from the premises; the central claim.

πŸ” Linguistic Indicators

Premise Indicators:

  • Since
  • For
  • Because
  • On account of

Conclusion Indicators:

  • Therefore
  • Thus
  • It follows that
  • Consequently
πŸ“Œ Deductive Reasoning πŸ“
πŸ›‘οΈ

The Standard of Certainty

Deduction

In deductive reasoning, premises are intended to provide an absolute guarantee for the truth of the conclusion.

πŸ“ Validity

Purely structural. An argument is valid if and only if it is impossible for the premises to be true and the conclusion to be false simultaneously.

πŸ’Ž Soundness

Structure + Truth. An argument is sound if it is valid AND all its premises are actually true in the real world.

⚠️ Exam Trap An argument can be Valid but Unsound.

Example: "All dogs are white. Tom is a dog. Therefore, Tom is white."
Logic works (Valid), but the premise is false (Unsound).
πŸ“Œ Inductive Reasoning 🎲
🌊

The Standard of Probability

Induction

Inductive reasoning provides probable, but not certain, support for the conclusion.

An inductive argument accepts the "risk" that premises could be true while the conclusion is false.
πŸ“Š Inductive Strength

Unlike deduction, we use Strength to measure induction. Strength refers to the degree to which the premises make the conclusion likely.

Look for "probability words" like: most, probably, likely, 90% of...
πŸ“Œ Comparison Table
Feature Deductive Argument Inductive Argument
Goal Certainty / Necessity Probability / Likelihood
Primary Metric Validity Strength
Failure State Invalidity Weakness
πŸ“Œ Logical Consistency 🀝
🧩

Consistency in Sets

Set Theory

Consistency is a property of a set of sentences (multiple sentences at once).

βœ… Consistent

It is possible for all members of the set to be true at the same time.

❌ Inconsistent

It is impossible for all members to be true (they contradict).

πŸ“ Examples

Consistent: {Nizwa is in Oman. Two is even. Today is Monday.}

Inconsistent: {Henry likes ice cream. Ice cream is dairy. Henry likes no dairy.}

πŸ“Œ Truth and Indeterminacy πŸ’Ž
✨ Logical Truth

Impossible to be false (True by necessity).

πŸŒ‘ Logical Falsity

Impossible to be true (False by necessity).

❓ Indeterminacy

Truth depends on empirical facts.

πŸ“Œ Logical Equivalence ↔️
πŸ”„

Sentence Relationships

Two sentences are logically equivalent if it is impossible for one to be true while the other is false.

πŸ’‘ Key Rules
  • Any two logically true sentences are equivalent.
  • Any two logically false sentences are equivalent.
πŸ” Comparison
"Henry loves Sarah" ↔ "Sarah is loved by Henry" (Equivalent)
"Henry loves Sarah" ↔ "Sarah loves Henry" (Not Equivalent)
πŸ“Œ Symbolization Basics πŸ”‘
πŸ”’

The Building Blocks

Atomic Sentences

Simple sentences represented by single letters (A, B, C...). They cannot be broken down further.

Compound Sentences

Formed by combining atomic sentences using logical connectives.

Truth-Functional: A property where the truth value of a compound sentence is determined entirely by the truth values of its parts.
πŸ“Œ Truth-Functional Connectives πŸ› οΈ
Connective Symbol English Trigger Words Truth Rule
Negation Β¬ "not", "it is not the case that" Flips the truth value.
Conjunction ∧ "and", "but", "however", "moreover" True ONLY if both are True.
Disjunction ∨ "or" True if at least one is True.
Exclusive Or βŠ• "either... or... [but not both]" True if exactly one is True.
Material Conditional βŠƒ "if... then...", "only if", "provided that" False ONLY if P is T and Q is F.
Biconditional ≑ "if and only if", "just in case" True if both have the same value.
πŸ“Œ Complex Patterns 🧩
🚫 Neither/Nor

Can be symbolized as:

  • Β¬P ∧ Β¬Q
  • Β¬(P ∨ Q)
⚠️ Unless (The Trap)

"P unless Q" can be symbolized as:

  • P ∨ Q
  • Β¬Q βŠƒ P
  • Β¬P βŠƒ Q
πŸ“Œ Truth Table Reference πŸ“Š
P Q P ∧ Q P ∨ Q Β¬P P βŠƒ Q P ≑ Q
TTTTFTT
TFFTFFF
FTFTTTF
FFFFTTT