**What are the diffrent ways of saying proposition p → q**

Category: Math
Tag:
Discrete Math

By:
David
On:
Sat 29 August 2015
Pageviews: 11

The simple statement p → q in discrete mathematics gets confusing when put into English. Here is a table of the common ways of saying p → q:

### Reading

### Everything in this table means the same thing p → q :

p ... q | q ... p |
---|---|

if p then q | q if p |

if p, q | q when p |

p implies q | q whenever p |

p is sufficient for q | a sufficient condition for q is p |

a necessary condition for p is q | q is necessary for p |

p only if q | q unless ¬p |

p leads to q | q follows from p |

### Truth and false of p → q:

```
if ( P is true and q is false ){
return false;
}
else {
return true;
}
```