How to find this equivalent of the material conditional?

  • Context: Undergrad 
  • Thread starter Thread starter AimaneSN
  • Start date Start date
  • Tags Tags
    Logic
Click For Summary

Discussion Overview

The discussion revolves around the equivalence of the material conditional A → B and the expression (¬A ∨ B). Participants explore how to derive (¬A ∨ B) starting from A → B, examining definitions and logical reasoning without reaching a consensus on a mechanical method for this derivation.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant notes that the only proof they know relies on truth tables, suggesting that this may be the only method available if definitions are limited to truth tables.
  • Another participant defines "A implies B" as "it is not the case that A is true and B is false," which they argue is equivalent to "A is false or B is true" based on Boolean laws.
  • A detailed logical derivation is presented, showing how to arrive at (¬A ∨ B) using hypotheses and rules of inference such as Modus Ponens and disjunction introduction.
  • The converse of the initial claim is also discussed, demonstrating that if (¬A ∨ B) holds, then A → B can be derived, indicating a bidirectional relationship between the two expressions.

Areas of Agreement / Disagreement

Participants present various viewpoints and methods for understanding the equivalence, but no consensus is reached on a singular mechanical approach to derive (¬A ∨ B) from A → B.

Contextual Notes

Some limitations include the reliance on specific definitions of logical operators and the absence of a universally accepted mechanical method for the derivation discussed.

AimaneSN
Messages
5
Reaction score
1
Hi there,

It's well known that for two assertions A and B : A → B is equivalent to (nonA or B).

The only proof I know of this equivalence relies on the truth table, one just brute forces all the possible combinations of truth values and then notice they're the same every time with A → B and (nonA or B).

But how can we find the expression (nonA or B) in the first place ? I want some mechanical way that starts with A → B and gets us to (nonA or B)?

Thank you for reading.
 
Physics news on Phys.org
If the definitions of the symbols via truth tables is all you got, then that is the only way.
 
  • Like
Likes   Reactions: AimaneSN
I have always understood "A implies B" to be defined as "it is not the case that A is true and B is false", which by Boole's laws is equivalent to "A is false or B is true".
 
  • Like
Likes   Reactions: AimaneSN
We can also view it this way:

1. ##A\rightarrow B##. (Hypothesis)
2. ##A##. (Hypothesis)
3. ##B##. (1, 2: Modus ponens)
4. ##\neg A \lor B##. (3: Introduction of disjunction)
Thus: ##A\rightarrow B, \ A\vdash\neg A \lor B##.

1. ##A\rightarrow B##. (Hypothesis)
2. ##\neg A##. (Hypothesis)
3. ##\neg A \lor B##. (2: Introduction of disjunction)
Thus: ##A\rightarrow B, \ \neg A\vdash\neg A \lor B##.

The two conclusions now give ##A\rightarrow B\vdash\neg A \lor B##,
since if ##A\rightarrow B##, then ##\neg A \lor B## holds whether ##A## or ##\neg A## holds.

The converse also holds:

1. ##\neg A \lor B##. (Hypothesis)
2. ##A##. (Hypothesis)
3. ##B##. (1, 2: Elimination of disjunction)
Thus, ##\neg A \lor B,\ A \ \vdash B##, and by introduction of implication: ##\neg A \lor B\ \vdash A\rightarrow B##.
 
Last edited:

Similar threads

  • · Replies 12 ·
Replies
12
Views
7K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 7 ·
Replies
7
Views
5K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 40 ·
2
Replies
40
Views
8K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K