Propositional Logic: Difference between revisions

From BloomWiki
Jump to navigation Jump to search
BloomWiki: Propositional Logic
 
BloomWiki: Propositional Logic
 
Line 1: Line 1:
<div style="background-color: #4B0082; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
{{BloomIntro}}
{{BloomIntro}}
Propositional Logic is the "Math of Reasoning"—the most basic system of logic used to determine the truth of complex statements based on their "Building Blocks." In this system, we don't care about the *meaning* of a sentence; we only care about its "Truth Value" (True or False) and how it is connected by words like "And," "Or," and "If... then." From the ancient syllogisms of Aristotle to the "Logic Gates" inside every computer chip on Earth, propositional logic is the foundation of all clear thinking and all digital technology. It is the practice of turning "Language" into "Calculation."
Propositional Logic is the "Math of Reasoning"—the most basic system of logic used to determine the truth of complex statements based on their "Building Blocks." In this system, we don't care about the *meaning* of a sentence; we only care about its "Truth Value" (True or False) and how it is connected by words like "And," "Or," and "If... then." From the ancient syllogisms of Aristotle to the "Logic Gates" inside every computer chip on Earth, propositional logic is the foundation of all clear thinking and all digital technology. It is the practice of turning "Language" into "Calculation."
</div>


== Remembering ==
__TOC__
 
<div style="background-color: #000080; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Propositional Logic''' — A branch of logic that deals with propositions (which can be true or false) and the connections between them.
* '''Propositional Logic''' — A branch of logic that deals with propositions (which can be true or false) and the connections between them.
* '''Proposition''' — A statement that is either True or False (e.g., "The cat is on the mat").
* '''Proposition''' — A statement that is either True or False (e.g., "The cat is on the mat").
Line 16: Line 21:
* '''Atomic Proposition''' — A simple statement that cannot be broken down further (represented by letters like P, Q, or R).
* '''Atomic Proposition''' — A simple statement that cannot be broken down further (represented by letters like P, Q, or R).
* '''Logic Gate''' — A physical circuit in a computer that implements a logical connective (e.g., an AND gate).
* '''Logic Gate''' — A physical circuit in a computer that implements a logical connective (e.g., an AND gate).
</div>


== Understanding ==
<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Understanding</span> ==
Propositional logic is understood through '''Structure''' and '''Certainty'''.
Propositional logic is understood through '''Structure''' and '''Certainty'''.


Line 38: Line 45:


'''The 'Law of the Excluded Middle'''': The core rule of classical logic: a statement is either True or False. There is no "Maybe" or "Half-true." (While some "Fuzzy Logic" systems challenge this, most of math and computer science is built on this "Yes/No" binary).
'''The 'Law of the Excluded Middle'''': The core rule of classical logic: a statement is either True or False. There is no "Maybe" or "Half-true." (While some "Fuzzy Logic" systems challenge this, most of math and computer science is built on this "Yes/No" binary).
</div>


== Applying ==
<div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Applying</span> ==
'''Modeling 'The Logic Gate' (Simulating a digital circuit):'''
'''Modeling 'The Logic Gate' (Simulating a digital circuit):'''
<syntaxhighlight lang="python">
<syntaxhighlight lang="python">
Line 69: Line 78:
: '''Shannon’s Thesis (1937)''' → Claude Shannon's discovery that you can build "Boolean Logic" using electrical switches (Relays), launching the computer age.
: '''Shannon’s Thesis (1937)''' → Claude Shannon's discovery that you can build "Boolean Logic" using electrical switches (Relays), launching the computer age.
: '''Wittgenstein’s Tractatus (1921)''' → The book that introduced "Truth Tables" as a way to solve all the problems of philosophy through pure logic.
: '''Wittgenstein’s Tractatus (1921)''' → The book that introduced "Truth Tables" as a way to solve all the problems of philosophy through pure logic.
</div>


== Analyzing ==
<div style="background-color: #8B4500; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Analyzing</span> ==
{| class="wikitable"
{| class="wikitable"
|+ Logical Connectives Truth Table
|+ Logical Connectives Truth Table
Line 86: Line 97:
'''The Concept of "Soundness" vs. "Validity"''': Analyzing why logic isn't always "Real." An argument is '''Valid''' if the conclusion follows the rules of logic. An argument is '''Sound''' if it is valid AND the starting facts are actually true.
'''The Concept of "Soundness" vs. "Validity"''': Analyzing why logic isn't always "Real." An argument is '''Valid''' if the conclusion follows the rules of logic. An argument is '''Sound''' if it is valid AND the starting facts are actually true.
* Valid but Unsound: "All cats are made of cheese. I am a cat. Therefore, I am made of cheese." (The logic is perfect, but the facts are wrong).
* Valid but Unsound: "All cats are made of cheese. I am a cat. Therefore, I am made of cheese." (The logic is perfect, but the facts are wrong).
</div>


== Evaluating ==
<div style="background-color: #483D8B; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Evaluating</span> ==
Evaluating propositional logic:
Evaluating propositional logic:
# '''The "Real World" Problem''': Real language is "Messy." How do you translate "The cat is *mostly* on the mat" into a system that only allows True or False?
# '''The "Real World" Problem''': Real language is "Messy." How do you translate "The cat is *mostly* on the mat" into a system that only allows True or False?
Line 93: Line 106:
# '''AI vs. Logic''': Modern AI (like ChatGPT) doesn't use "Logic Gates" to think; it uses "Probabilities." Is this "Better" than the old logic, or just "Dumb but fast"?
# '''AI vs. Logic''': Modern AI (like ChatGPT) doesn't use "Logic Gates" to think; it uses "Probabilities." Is this "Better" than the old logic, or just "Dumb but fast"?
# '''Human Bias''': Why are humans so bad at "If... then" logic in real life? (e.g., The Wason Selection Task proves we are better at "Social logic" than "Abstract logic").
# '''Human Bias''': Why are humans so bad at "If... then" logic in real life? (e.g., The Wason Selection Task proves we are better at "Social logic" than "Abstract logic").
</div>


== Creating ==
<div style="background-color: #2F4F4F; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Creating</span> ==
Future Frontiers:
Future Frontiers:
# '''Fuzzy Logic Controllers''': Logic systems that allow for "Partially True" values, used to control things like smart washing machines or self-driving cars.
# '''Fuzzy Logic Controllers''': Logic systems that allow for "Partially True" values, used to control things like smart washing machines or self-driving cars.
Line 105: Line 120:
[[Category:Philosophy]]
[[Category:Philosophy]]
[[Category:Logic]]
[[Category:Logic]]
</div>

Latest revision as of 01:56, 25 April 2026

How to read this page: This article maps the topic from beginner to expert across six levels � Remembering, Understanding, Applying, Analyzing, Evaluating, and Creating. Scan the headings to see the full scope, then read from wherever your knowledge starts to feel uncertain. Learn more about how BloomWiki works ?

Propositional Logic is the "Math of Reasoning"—the most basic system of logic used to determine the truth of complex statements based on their "Building Blocks." In this system, we don't care about the *meaning* of a sentence; we only care about its "Truth Value" (True or False) and how it is connected by words like "And," "Or," and "If... then." From the ancient syllogisms of Aristotle to the "Logic Gates" inside every computer chip on Earth, propositional logic is the foundation of all clear thinking and all digital technology. It is the practice of turning "Language" into "Calculation."

Remembering[edit]

  • Propositional Logic — A branch of logic that deals with propositions (which can be true or false) and the connections between them.
  • Proposition — A statement that is either True or False (e.g., "The cat is on the mat").
  • Logical Connectives:
    • AND (Conjunction, ∧): True only if BOTH statements are true.
    • OR (Disjunction, ∨): True if AT LEAST ONE statement is true.
    • NOT (Negation, ¬): Flips the truth value (True becomes False).
    • IF... THEN (Implication, →): "If P is true, then Q must be true."
    • IF AND ONLY IF (Biconditional, ↔): True only if P and Q have the same value.
  • Truth Table — A mathematical table used to determine the outcome of a logical expression for every possible input.
  • Tautology — A statement that is "Always True" by its structure (e.g., "It is raining or it is not raining").
  • Contradiction — A statement that is "Always False" (e.g., "It is raining and it is not raining").
  • Atomic Proposition — A simple statement that cannot be broken down further (represented by letters like P, Q, or R).
  • Logic Gate — A physical circuit in a computer that implements a logical connective (e.g., an AND gate).

Understanding[edit]

Propositional logic is understood through Structure and Certainty.

1. The Logic of "If... Then" (Implication): This is the most misunderstood part of logic.

  • In logic, "If P then Q" is only **FALSE** if P is true but Q is false.
  • If P is false, the whole statement is "Vacuously True."
  • For example: "If I am a billionaire, I will buy you a car." If I am *not* a billionaire, I haven't lied! The statement is still technically "True" because the condition wasn't met.

2. Truth Tables (The Map of Truth): A truth table allows us to "Calculate" the truth of any statement.

  • If you have two inputs (P and Q), there are 4 possible worlds: (T,T), (T,F), (F,T), (F,F).
  • By filling in the table, we can prove that two different sentences mean exactly the same thing (Logical Equivalence).
  • For example, "If it rains, I get wet" is the same as "Either it doesn't rain, or I get wet."

3. De Morgan’s Laws: A fundamental rule of logic:

  • "NOT (P AND Q)" is the same as "(NOT P) OR (NOT Q)."
  • For example: "It is not the case that I am both rich AND happy" means "I am either not rich OR I am not happy."

The 'Law of the Excluded Middle': The core rule of classical logic: a statement is either True or False. There is no "Maybe" or "Half-true." (While some "Fuzzy Logic" systems challenge this, most of math and computer science is built on this "Yes/No" binary).

Applying[edit]

Modeling 'The Logic Gate' (Simulating a digital circuit): <syntaxhighlight lang="python"> def logic_gate(p, q, gate_type):

   """
   Simulates the core logical connectives.
   """
   if gate_type == "AND":
       return p and q
   elif gate_type == "OR":
       return p or q
   elif gate_type == "XOR": # Exclusive OR (One or the other, but not both)
       return p != q
   elif gate_type == "IF_THEN":
       return not p or q # Logical equivalent of P -> Q
       
   return None
  1. P: True (User is logged in) | Q: False (User has paid)
  2. Gate: AND (Allow access?)

print(f"Access Granted: {logic_gate(True, False, 'AND')}")

  1. Gate: IF_THEN (If logged in, then show profile?)

print(f"Show Profile: {logic_gate(True, True, 'IF_THEN')}") </syntaxhighlight>

Logic Landmarks
The Organon (350 BC) → Aristotle's collection of works that defined the first rules of logic (Syllogisms), which ruled the world for 2,000 years.
The Laws of Thought (1854) → George Boole's book that "Algebraized" logic, showing that you can treat True/False just like 1/0. This is why we call it "Boolean Logic."
Shannon’s Thesis (1937) → Claude Shannon's discovery that you can build "Boolean Logic" using electrical switches (Relays), launching the computer age.
Wittgenstein’s Tractatus (1921) → The book that introduced "Truth Tables" as a way to solve all the problems of philosophy through pure logic.

Analyzing[edit]

Logical Connectives Truth Table
P Q P ∧ Q (AND) P ∨ Q (OR) P → Q (IF)
T T T T T
T F F T F
F T F T T
F F F F T

The Concept of "Soundness" vs. "Validity": Analyzing why logic isn't always "Real." An argument is Valid if the conclusion follows the rules of logic. An argument is Sound if it is valid AND the starting facts are actually true.

  • Valid but Unsound: "All cats are made of cheese. I am a cat. Therefore, I am made of cheese." (The logic is perfect, but the facts are wrong).

Evaluating[edit]

Evaluating propositional logic:

  1. The "Real World" Problem: Real language is "Messy." How do you translate "The cat is *mostly* on the mat" into a system that only allows True or False?
  2. Paradoxes: Can logic handle sentences like "This sentence is false"? (The Liar's Paradox breaks traditional propositional logic).
  3. AI vs. Logic: Modern AI (like ChatGPT) doesn't use "Logic Gates" to think; it uses "Probabilities." Is this "Better" than the old logic, or just "Dumb but fast"?
  4. Human Bias: Why are humans so bad at "If... then" logic in real life? (e.g., The Wason Selection Task proves we are better at "Social logic" than "Abstract logic").

Creating[edit]

Future Frontiers:

  1. Fuzzy Logic Controllers: Logic systems that allow for "Partially True" values, used to control things like smart washing machines or self-driving cars.
  2. Quantum Logic Gates: Logic gates for quantum computers that allow a bit to be "True AND False" at the same time (Superposition).
  3. Probabilistic Logic Programming: Merging the "Certainty" of logic with the "Uncertainty" of AI to create "Transparent AI" that we can understand.
  4. Formal Ethics: Turning ethical rules (like "Do no harm") into propositional logic that a robot can "Calculate" to make a decision in a split second.