- #1
AimaneSN
- 5
- 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.
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.