The *implication* of `A`

and `B`

written `A ⇒ B`

is equivalent to `¬A ∨ B`

.
Sometimes `A`

is called the *antecedent* and `B`

is called the *consequent*.

The truth table below shows all possible combinations for an implication.
Here `t`

stands for true, and `f`

stands for false.

` A ` | ` B ` | ` A ⇒ B ` |
---|---|---|

`f` | `f` | `t` |

`f` | `t` | `t` |

`t` | `f` | `f` |

`t` | `t` | `t` |

Doets, Kees. *From Logic to Logic Programming.* MIT Press, 1994.

Harrison, John. *Handbook of Practical Logic and Automated Reasoning.* Cambridge, 2009.

Copyright © 2014, 2015 Barry Watson. All rights reserved.