when I was reading a paper about the universal quantifier, I met this equation, says we can do conversions like the following:
A -> B ≡ ¬A v B
can anyone help me understand why this is an equation? Thanks
when I was reading a paper about the universal quantifier, I met this equation, says we can do conversions like the following:
A -> B ≡ ¬A v B
can anyone help me understand why this is an equation? Thanks
One way is with a truth table $$\begin {array} {c| c| c| c} A&B&A \implies B& \lnot A \vee B\\ \hline T&T&T&T \\ T&F&F&F\\F&T&T&T\\F&F&T&T\end {array}$$